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 listSep 15, 2026 06:34Victor MerckléVictor MerckléScore: 3,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 06:373,44938,391,70527,515,0001,119,0002,117,632stderr
2Sep 15, 2026 06:373,46640,152,50027,639,0001,130,0002,117,632stderr
3Sep 15, 2026 06:373,46839,295,57027,653,0001,135,0002,117,632stderr
4Sep 15, 2026 06:373,51538,964,61028,069,0001,108,0002,117,632stderr
5Sep 15, 2026 06:373,54639,263,16728,326,0001,114,0002,117,632stderr
6Sep 15, 2026 06:373,54839,122,29828,337,0001,117,0002,117,632stderr
7Sep 15, 2026 06:373,56939,369,34028,493,0001,130,0002,117,632stderr
8Sep 15, 2026 06:373,57640,184,30028,564,0001,124,0002,117,632stderr
9Sep 15, 2026 06:373,60340,456,43928,776,0001,133,0002,117,632stderr