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 listJul 1, 2026 16:52Victor MerckléVictor MerckléScore: 11,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 16:5311,258101,397,89792,422,0001,020,0002,117,632stderr
2Jul 1, 2026 16:5311,262101,422,69292,470,0001,011,0002,117,632stderr
3Jul 1, 2026 16:5311,266101,485,66592,373,0001,138,0002,117,632stderr
4Jul 1, 2026 16:5311,279101,532,03792,538,0001,081,0002,117,632stderr
5Jul 1, 2026 16:5311,295101,770,29592,645,0001,106,0002,117,632stderr
6Jul 1, 2026 16:5311,323101,865,94192,879,0001,105,0002,117,632stderr
7Jul 1, 2026 16:5311,323101,961,27192,926,0001,055,0002,117,632stderr
8Jul 1, 2026 16:5311,351102,140,64293,181,0001,034,0002,117,632stderr
9Jul 1, 2026 16:5311,521103,969,31294,526,0001,104,0002,117,632stderr