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 13, 2026 20:59Victor MerckléVictor MerckléScore: 7,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:007,77971,895,67963,466,0001,101,0002,117,632stderr
2May 13, 2026 21:007,78071,864,62663,451,0001,130,0002,117,632stderr
3May 13, 2026 21:007,78274,763,74463,462,0001,135,0002,117,632stderr
4May 13, 2026 21:007,78371,911,51363,491,0001,112,0002,117,632stderr
5May 13, 2026 21:007,78873,331,00663,534,0001,108,0002,117,632stderr
6May 13, 2026 21:007,79172,401,61463,539,0001,132,0002,117,632stderr
7May 13, 2026 21:007,79473,702,15163,569,0001,129,0002,117,632stderr
8May 13, 2026 21:007,79473,973,21263,571,0001,125,0002,117,632stderr
9May 13, 2026 21:007,79973,942,85663,657,0001,081,0002,117,632stderr