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 25, 2026 03:41Victor MerckléVictor MerckléScore: 4,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 03:424,38344,718,27135,297,0001,082,0002,117,632stderr
2Aug 25, 2026 03:424,39245,602,95535,357,0001,101,0002,117,632stderr
3Aug 25, 2026 03:424,40244,863,86935,504,0001,035,0002,117,632stderr
4Aug 25, 2026 03:424,40845,608,19635,489,0001,098,0002,117,632stderr
5Aug 25, 2026 03:424,41144,910,28835,525,0001,088,0002,117,632stderr
6Aug 25, 2026 03:424,41444,940,38435,577,0001,065,0002,117,632stderr
7Aug 25, 2026 03:424,41944,980,49835,614,0001,064,0002,117,632stderr
8Aug 25, 2026 03:424,43845,117,02135,738,0001,098,0002,117,632stderr
9Aug 25, 2026 03:424,44145,210,59835,800,0001,061,0002,117,632stderr