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 27, 2026 02:09Victor MerckléVictor MerckléScore: 4,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:093,99241,525,72731,959,0001,181,0002,117,632stderr
2Aug 27, 2026 02:094,00341,652,70532,060,0001,169,0002,117,632stderr
3Aug 27, 2026 02:094,01441,655,94532,179,0001,139,0002,117,632stderr
4Aug 27, 2026 02:094,01541,732,73532,251,0001,077,0002,117,632stderr
5Aug 27, 2026 02:094,01841,714,62032,285,0001,069,0002,117,632stderr
6Aug 27, 2026 02:094,02341,755,46932,266,0001,130,0002,117,632stderr
7Aug 27, 2026 02:094,03741,849,78332,428,0001,082,0002,117,632stderr
8Aug 27, 2026 02:094,04342,462,42632,401,0001,159,0002,117,632stderr
9Aug 27, 2026 02:094,05642,125,01732,546,0001,126,0002,117,632stderr