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 19, 2026 14:07Victor MerckléVictor MerckléScore: 6,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:085,90559,003,07747,995,0001,020,0002,117,632stderr
2May 19, 2026 14:085,90658,682,01047,997,0001,029,0002,117,632stderr
3May 19, 2026 14:085,90957,899,48048,011,0001,039,0002,117,632stderr
4May 19, 2026 14:085,94659,892,63548,327,0001,027,0002,117,632stderr
5May 19, 2026 14:086,01660,142,39648,899,0001,034,0002,117,632stderr
6May 19, 2026 14:086,08159,904,82649,457,0001,017,0002,117,632stderr
7May 19, 2026 14:086,09659,906,85749,587,0001,011,0002,117,632stderr
8May 19, 2026 14:086,12659,982,74649,821,0001,032,0002,117,632stderr
9May 19, 2026 14:086,22061,482,67850,604,0001,029,0002,117,632stderr