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 18, 2026 15:16Kevin HeaveyKevin HeaveyScore: 3,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 15:233,59039,394,71628,644,0001,160,0002,113,536
2Jul 18, 2026 15:233,60239,507,64628,735,0001,163,0002,113,536
3Jul 18, 2026 15:233,62839,691,83828,970,0001,150,0002,113,536
4Jul 18, 2026 15:233,75540,795,94130,002,0001,167,0002,113,536
5Jul 18, 2026 15:233,79341,135,61030,293,0001,191,0002,113,536
6Jul 18, 2026 15:233,80141,222,68230,344,0001,207,0002,113,536
7Jul 18, 2026 15:233,88942,518,27631,124,0001,162,0002,113,536
8Jul 18, 2026 15:233,90742,104,59831,230,0001,205,0002,113,536
9Jul 18, 2026 15:233,90942,103,00531,407,0001,043,0002,113,536