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 5, 2026 20:21Kevin HeaveyKevin HeaveyScore: 5,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:225,24753,113,33541,593,0001,958,0002,121,728stderr
2Jul 5, 2026 20:225,25653,205,74741,660,0001,973,0002,121,728stderr
3Jul 5, 2026 20:225,36054,065,50842,549,0001,946,0002,121,728stderr
4Jul 5, 2026 20:225,37854,232,00242,641,0001,998,0002,121,728stderr
5Jul 5, 2026 20:225,39254,390,38442,805,0001,950,0002,121,728stderr
6Jul 5, 2026 20:225,39254,339,50842,806,0001,951,0002,121,728stderr
7Jul 5, 2026 20:225,39854,478,79042,840,0001,966,0002,121,728stderr
8Jul 5, 2026 20:225,40054,399,26942,872,0001,948,0002,121,728stderr
9Jul 5, 2026 20:225,42054,544,66243,028,0001,958,0002,121,728stderr