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 17, 2026 18:33Kevin HeaveyKevin HeaveyScore: 3,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 18:353,62539,817,12228,848,0001,240,0002,117,632
2Jul 17, 2026 18:353,66140,118,54429,165,0001,227,0002,117,632
3Jul 17, 2026 18:353,73640,739,73629,764,0001,246,0002,117,632
4Jul 17, 2026 18:353,77141,002,00430,083,0001,222,0002,117,632
5Jul 17, 2026 18:353,82541,495,55330,506,0001,242,0002,117,632
6Jul 17, 2026 18:353,83841,618,11830,629,0001,234,0002,117,632
7Jul 17, 2026 18:353,88442,034,72831,201,0001,041,0002,117,632
8Jul 17, 2026 18:353,88541,996,42831,208,0001,039,0002,117,632
9Jul 17, 2026 18:353,90642,140,56631,383,0001,038,0002,117,632