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 02:07Victor MerckléVictor MerckléScore: 4,396Success
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 02:084,36044,602,38335,061,0001,127,0002,117,632stderr
2Aug 12, 2026 02:084,37544,664,48835,210,0001,107,0002,117,632stderr
3Aug 12, 2026 02:084,38244,507,22335,264,0001,109,0002,117,632stderr
4Aug 12, 2026 02:084,38544,561,55035,283,0001,115,0002,117,632stderr
5Aug 12, 2026 02:084,39644,689,48935,352,0001,139,0002,117,632stderr
6Aug 12, 2026 02:084,40244,984,00035,367,0001,173,0002,117,632stderr
7Aug 12, 2026 02:084,41845,030,25635,629,0001,048,0002,117,632stderr
8Aug 12, 2026 02:084,42145,166,69235,663,0001,036,0002,117,632stderr
9Aug 12, 2026 02:084,44645,267,76635,814,0001,095,0002,117,632stderr