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 listOct 25, 2026 15:59timothygktimothygkScore: 8,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 16:048,32079,975,17958,746,00010,317,0002,117,632stderr
2Oct 25, 2026 16:048,36280,373,73658,844,00010,565,0002,117,632stderr
3Oct 25, 2026 16:048,38780,555,90759,172,00010,447,0002,117,632stderr
4Oct 25, 2026 16:048,45581,644,24359,168,00011,011,0002,117,632stderr
5Oct 25, 2026 16:048,50882,817,52660,182,00010,442,0002,117,632stderr
6Oct 25, 2026 16:048,51081,845,86659,343,00011,294,0002,117,632stderr
7Oct 25, 2026 16:048,63282,711,52261,140,00010,508,0002,117,632stderr
8Oct 25, 2026 16:048,76184,125,42162,030,00010,688,0002,117,632stderr
9Oct 25, 2026 16:048,96885,447,87562,744,00011,693,0002,117,632stderr