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 7, 2026 16:03Victor MerckléVictor MerckléScore: 5,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:064,99049,963,88836,100,0005,323,0002,117,632stderr
2Sep 7, 2026 16:065,02650,293,86136,720,0004,999,0002,117,632stderr
3Sep 7, 2026 16:065,22552,014,49436,823,0006,548,0002,117,632stderr
4Sep 7, 2026 16:065,37253,126,38036,667,0007,926,0002,117,632stderr
5Sep 7, 2026 16:065,40353,403,83937,110,0007,743,0002,117,632stderr
6Sep 7, 2026 16:065,50854,959,74137,478,0008,243,0002,117,632stderr
7Sep 7, 2026 16:065,63755,363,99336,422,00010,373,0002,117,632stderr
8Sep 7, 2026 16:065,65655,478,26836,462,00010,489,0002,117,632stderr
9Sep 7, 2026 16:065,72356,177,91636,940,00010,567,0002,117,632stderr