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 14, 2026 09:26Victor MerckléVictor MerckléScore: 61,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:2661,398519,011,812508,601,0001,003,0002,117,632stderr
2May 14, 2026 09:2661,435517,243,443508,915,0001,001,0002,117,632stderr
3May 14, 2026 09:2661,440519,869,780508,950,0001,003,0002,117,632stderr
4May 14, 2026 09:2661,447517,359,507509,013,0001,003,0002,117,632stderr
5May 14, 2026 09:2661,447521,533,822509,014,0001,003,0002,117,632stderr
6May 14, 2026 09:2661,458519,584,271509,100,0001,003,0002,117,632stderr
7May 14, 2026 09:2661,481517,412,995509,292,0001,002,0002,117,632stderr
8May 14, 2026 09:2661,494517,618,498509,400,0001,002,0002,117,632stderr
9May 14, 2026 09:2661,501518,053,010509,458,0001,001,0002,117,632stderr