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 8, 2026 09:58Victor MerckléVictor MerckléScore: 6,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 10:016,89166,461,49947,135,00010,063,0002,117,632stderr
2Sep 8, 2026 10:016,89766,373,64147,245,00010,006,0002,117,632stderr
3Sep 8, 2026 10:016,93466,658,85347,621,0009,932,00024,576stderr
4Sep 8, 2026 10:016,93866,772,01748,282,0009,306,0002,117,632stderr
5Sep 8, 2026 10:016,99167,168,55846,476,00011,552,0002,117,632stderr
6Sep 8, 2026 10:017,01467,357,84446,803,00011,420,0002,117,632stderr
7Sep 8, 2026 10:017,04167,664,35647,029,00011,418,0002,117,632stderr
8Sep 8, 2026 10:017,04766,964,98246,973,00011,519,0002,117,632stderr
9Sep 8, 2026 10:017,08568,957,94647,722,00011,087,0002,117,632stderr