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 16, 2026 22:02Kevin HeaveyKevin HeaveyScore: 3,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 22:073,76840,982,30930,242,0001,033,0002,113,536
2Jul 16, 2026 22:073,77341,095,36830,296,0001,027,0002,113,536
3Jul 16, 2026 22:073,77741,311,43830,329,0001,028,0002,113,536
4Jul 16, 2026 22:073,78641,181,23530,401,0001,029,0002,113,536
5Jul 16, 2026 22:073,79741,368,82130,490,0001,028,0002,113,536
6Jul 16, 2026 22:073,80641,374,25030,533,0001,062,0002,113,536
7Jul 16, 2026 22:073,81041,428,55030,598,0001,027,0002,113,536
8Jul 16, 2026 22:073,83841,594,67630,816,0001,041,0002,113,536
9Jul 16, 2026 22:073,84142,655,86630,839,0001,046,0002,113,536