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 listMay 21, 2025 18:29vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:00Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:01042,173,85233,035,0001,028,0002,113,536expected "74600294196621100 ", got "76083481872827905 "
2Jul 7, 2026 03:014,08341,983,51232,866,0001,027,0002,113,536
3Jul 7, 2026 03:014,14942,409,20532,428,0002,009,0002,113,536
4May 21, 2025 18:294,64261,111,24436,499,0002,027,0002,527,232
5May 21, 2025 18:294,64665,279,95535,515,0003,044,0002,273,280
6May 21, 2025 18:294,66665,701,20735,750,0002,979,0002,433,024
7May 21, 2025 18:294,67667,111,29935,824,0002,985,0002,273,280
8May 21, 2025 18:294,68760,122,37135,906,0002,992,0002,273,280
9May 21, 2025 18:294,70364,970,58036,034,0003,002,0002,433,024