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 08:26Victor MerckléVictor MerckléScore: 63,702Success
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 08:2663,522535,257,377515,725,00011,508,0002,117,632stderr
2May 14, 2026 08:2663,562534,932,225516,005,00011,563,0002,117,632stderr
3May 14, 2026 08:2663,622537,215,095516,466,00011,599,0002,117,632stderr
4May 14, 2026 08:2663,674538,862,212516,417,00012,081,0002,117,632stderr
5May 14, 2026 08:2663,702536,031,105517,124,00011,606,0002,117,632stderr
6May 14, 2026 08:2663,718536,845,981516,717,00012,146,0002,117,632stderr
7May 14, 2026 08:2663,721536,392,666517,131,00011,760,0002,117,632stderr
8May 14, 2026 08:2663,757536,462,183517,723,00011,466,0002,117,632stderr
9May 14, 2026 08:2663,930539,576,220516,374,00014,251,0002,117,632stderr