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 12, 2026 14:14Victor MerckléVictor MerckléScore: 3,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 14:153,77639,764,14530,246,0001,095,0002,117,632stderr
2Aug 12, 2026 14:153,78439,828,14830,335,0001,078,0002,117,632stderr
3Aug 12, 2026 14:153,79339,858,28130,407,0001,075,0002,117,632stderr
4Aug 12, 2026 14:153,79840,002,28930,434,0001,097,0002,117,632stderr
5Aug 12, 2026 14:153,80139,993,48330,411,0001,140,0002,117,632stderr
6Aug 12, 2026 14:153,81039,949,29830,539,0001,085,0002,117,632stderr
7Aug 12, 2026 14:153,81840,144,07630,578,0001,116,0002,117,632stderr
8Aug 12, 2026 14:153,98741,507,05631,999,0001,101,0002,117,632stderr
9Aug 12, 2026 14:154,10542,644,24833,029,0001,043,0002,117,632stderr