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 listApr 22, 2026 04:43wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:48041,358,64630,879,0001,009,0002,113,536expected "74600294196621100 ", got "74590701213236477 "
2Jul 6, 2026 17:48038,245,55527,706,0001,163,0002,113,536expected "74600294196621100 ", got "74924959768025918 "
3Jul 6, 2026 17:48040,359,96729,942,0001,013,0002,113,536expected "74600294196621100 ", got "74594221361833477 "
4Apr 22, 2026 04:433,74148,411,42229,051,0002,003,0002,383,872
5Apr 22, 2026 04:433,74649,922,26429,088,0002,006,0002,383,872
6Apr 22, 2026 04:433,78648,616,58830,416,0001,013,0002,379,776