# Project Euler/8

Jump to navigation
Jump to search

**Project Euler Problem 8** is a problem related to searching on a 1D strip. It requires finding the largest product of 13 adjacent digits in a 1000-digit constant. The constant can be found on the talk page.

*This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by adding some more information.*

## Implementations

### Aheui

This program takes the 1000-digit constant as input. Unfortunately, the program works on Try it Online but fails on AheuiChem.

밯발발나다뿌 코터떠벍벍처마바바바바바바바바바바바바수머 싸싼순희쑨버버버버버버버버버버버버버버빠쏙 뽀섣떠몽숙ㅇㅇㅇㅇ머선ㅇ쳐펴선 사순ㅇ손빠싸마샤숟빠싿며 쑌퍄녀뺘별쌷별퍄며빠싿삳조

## External resources

- Problem 8 on Project Euler Official Website (not available)
- Problem 8 on Project Euler Mirror