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 11, 2026 00:49Victor MerckléVictor MerckléScore: 4,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 00:504,01542,282,11732,170,0001,155,0002,117,632stderr
2Aug 11, 2026 00:504,03341,880,09932,327,0001,152,0002,117,632stderr
3Aug 11, 2026 00:504,05141,813,48732,496,0001,133,0002,117,632stderr
4Aug 11, 2026 00:504,06441,889,65232,608,0001,127,0002,117,632stderr
5Aug 11, 2026 00:504,07842,241,74732,761,0001,092,0002,117,632stderr
6Aug 11, 2026 00:504,09842,211,83332,843,0001,177,0002,117,632stderr
7Aug 11, 2026 00:504,15042,619,91633,300,0001,152,0002,117,632stderr
8Aug 11, 2026 00:504,15242,669,34333,383,0001,080,0002,117,632stderr
9Aug 11, 2026 00:504,16343,545,91833,381,0001,172,0002,117,632stderr