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 listMar 8, 2026 15:43caandocaandoScore: 5,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 15:435,50071,640,80744,632,0001,014,0002,387,968
2Mar 8, 2026 15:435,52870,283,30044,883,000997,0002,260,992
3Mar 8, 2026 15:435,54468,565,22244,017,0002,000,0002,519,040
4Mar 8, 2026 15:435,54568,373,03844,024,0002,001,0002,285,568
5Mar 8, 2026 15:435,54881,133,93243,044,0003,003,0002,285,568
6Mar 8, 2026 15:435,55568,546,14244,102,0002,004,0002,514,944