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 listFeb 26, 2026 20:24Mikołaj UzarskiMikołaj UzarskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:28Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:28049,769,80539,003,0001,017,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
2Jul 7, 2026 21:28049,685,92738,334,0001,015,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
3Jul 7, 2026 21:28049,135,91638,425,0001,015,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
4Feb 26, 2026 20:245,13571,013,72340,592,0002,029,0002,293,760
5Feb 26, 2026 20:245,15766,623,67040,810,0001,990,0002,392,064
6Feb 26, 2026 20:245,17366,820,30639,941,0002,995,0002,293,760