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 21, 2026 09:58Kevin HeaveyKevin HeaveyScore: 3,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 10:003,58040,112,51628,656,0001,060,0002,113,536
2Jul 21, 2026 10:003,59239,746,27728,767,0001,047,0002,113,536
3Jul 21, 2026 10:003,79341,955,49830,447,0001,042,0002,113,536
4Jul 21, 2026 10:003,80342,048,80530,531,0001,042,0002,113,536
5Jul 21, 2026 10:003,82242,243,90630,496,0001,229,0002,113,536
6Jul 21, 2026 10:003,85542,423,16830,959,0001,044,0002,113,536
7Jul 21, 2026 10:003,86741,914,67831,052,0001,045,0002,117,632
8Jul 21, 2026 10:003,87242,647,34731,102,0001,041,0002,113,536
9Jul 21, 2026 10:003,88742,692,50231,218,0001,046,0002,113,536