Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 2, 2025 20:46Jack FrigaardJack FrigaardError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:31Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:31046,568,84335,919,0001,016,0002,113,536expected "27617841214539459 ", got "158608166194558529 "
2Jul 7, 2026 21:31047,610,81336,269,0001,019,0002,113,536expected "27617841214539459 ", got "158608166194558529 "
3Jul 7, 2026 21:31047,562,15736,299,0001,019,0002,113,536expected "27617841214539459 ", got "158608166194558529 "
4Aug 2, 2025 20:464,64763,670,46437,553,0001,014,0002,478,080
5Aug 2, 2025 20:464,68261,911,11735,872,0002,989,0002,473,984
6Aug 2, 2025 20:464,71561,920,87336,126,0003,010,0002,285,568
7Aug 2, 2025 20:464,72368,123,37137,194,0002,010,0002,285,568
8Aug 2, 2025 20:464,74360,898,37637,352,0002,019,0002,465,792
9Aug 2, 2025 20:465,29671,277,17441,962,0001,998,0002,285,568