We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
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 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.
밯발발나다뿌 코터떠벍벍처마바바바바바바바바바바바바수머 싸싼순희쑨버버버버버버버버버버버버버버빠쏙 뽀섣떠몽숙ㅇㅇㅇㅇ머선ㅇ쳐펴선 사순ㅇ손빠싸마샤숟빠싿며 쑌퍄녀뺘별쌷별퍄며빠싿삳조
Doki!
Act 1:Monika:”Number”, “7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450” Act 4:Sayori[Debug]Number MC[StringtoList]Number MC[ConverttoNumber]Number Act 1:Natsuki[Outburst!]Act 1:Monika[Mult]Index(n+13) Act 3:Monika[Var]”BiggestProduct”, Act 1:Natsuki[ParfaitGirls!]NatsukiMerge_Number MC[GivePoem]BiggestProduct Act 4:Sayori[ThankYou]
External resources
- Problem 8 on Project Euler Official Website (not available)
- Problem 8 on Project Euler Mirror