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 15, 2026 08:08Victor MerckléVictor MerckléScore: 6,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 08:086,97267,795,41057,874,00002,113,536
2May 15, 2026 08:086,97467,561,07456,859,0001,029,0002,113,536
3May 15, 2026 08:086,97566,014,52756,896,0001,004,0002,113,536
4May 15, 2026 08:086,97566,059,74657,897,00002,113,536
5May 15, 2026 08:086,97565,422,36957,894,00002,113,536
6May 15, 2026 08:086,97567,231,28056,864,0001,034,0002,113,536
7May 15, 2026 08:086,97567,412,74157,897,00002,113,536
8May 15, 2026 08:086,97965,395,59357,927,00002,113,536
9May 15, 2026 08:087,02765,703,34158,330,00002,113,536