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 listSep 8, 2026 09:32Victor MerckléVictor MerckléScore: 3,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:373,71439,309,76929,786,0001,042,0002,117,632stderr
2Sep 8, 2026 09:373,76039,721,67030,093,0001,116,0002,117,632stderr
3Sep 8, 2026 09:373,78139,875,88530,366,0001,022,0002,117,632stderr
4Sep 8, 2026 09:373,79340,659,70130,477,0001,008,0002,117,632stderr
5Sep 8, 2026 09:373,83540,384,41030,712,0001,125,0002,117,632stderr
6Sep 8, 2026 09:373,84540,428,83430,914,0001,007,0002,117,632stderr
7Sep 8, 2026 09:373,89040,771,12331,166,0001,125,0002,117,632stderr
8Sep 8, 2026 09:373,91240,908,24331,353,0001,124,0002,117,632stderr
9Sep 8, 2026 09:373,91941,095,93631,396,0001,133,0002,117,632stderr