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 13:00Victor MerckléVictor MerckléScore: 10,246Success
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 13:0310,14992,760,17183,033,0001,208,0002,117,632stderr
2Sep 8, 2026 13:0310,16893,581,93983,296,0001,105,0002,117,632stderr
3Sep 8, 2026 13:0310,19093,780,32183,383,0001,194,0002,117,632stderr
4Sep 8, 2026 13:0310,24293,516,34381,963,0003,053,0002,117,632stderr
5Sep 8, 2026 13:0310,24693,614,97483,084,0001,961,00024,576stderr
6Sep 8, 2026 13:0310,28494,500,36383,485,0001,873,00024,576stderr
7Sep 8, 2026 13:0310,29094,508,83483,561,0001,851,00024,576stderr
8Sep 8, 2026 13:0310,33694,288,41083,581,0002,215,00024,576stderr
9Sep 8, 2026 13:0310,40495,539,08783,187,0003,170,0002,117,632stderr