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 05:56Victor MerckléVictor MerckléScore: 6,997Success
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 05:566,97866,592,19157,923,00002,113,536
2May 15, 2026 05:566,97866,739,41856,906,0001,016,0002,113,536
3May 15, 2026 05:566,98067,723,36757,937,00002,113,536
4May 15, 2026 05:566,99167,645,58656,917,0001,115,0002,113,536
5May 15, 2026 05:566,99767,586,66557,006,0001,077,0002,113,536
6May 15, 2026 05:567,02667,661,18657,293,0001,027,0002,113,536
7May 15, 2026 05:567,03666,168,60457,398,0001,001,0002,113,536
8May 15, 2026 05:567,07568,880,85957,679,0001,048,0002,113,536
9May 15, 2026 05:567,12267,294,81158,070,0001,047,0002,113,536