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 listAug 28, 2026 19:15Victor MerckléVictor MerckléScore: 3,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:153,67239,474,93729,347,0001,136,0002,117,632stderr
2Aug 28, 2026 19:153,67639,564,09729,331,0001,185,0002,117,632stderr
3Aug 28, 2026 19:153,67739,569,01129,392,0001,133,0002,117,632stderr
4Aug 28, 2026 19:153,68239,540,43629,413,0001,155,0002,117,632stderr
5Aug 28, 2026 19:153,68238,858,82729,412,0001,153,0002,117,632stderr
6Aug 28, 2026 19:153,69538,835,17329,477,0001,198,0002,117,632stderr
7Aug 28, 2026 19:153,69838,820,08529,613,0001,085,0002,117,632stderr
8Aug 28, 2026 19:153,70139,614,09629,581,0001,145,0002,117,632stderr
9Aug 28, 2026 19:153,87940,310,50131,136,0001,060,0002,117,632stderr