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 00:43Kevin HeaveyKevin HeaveyScore: 3,810Success
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 00:483,71140,550,64929,750,0001,053,0002,113,536
2Jul 17, 2026 00:483,71940,591,51029,821,0001,048,0002,113,536
3Jul 17, 2026 00:483,74240,857,71630,014,0001,051,0002,113,536
4Jul 17, 2026 00:483,78241,214,92730,347,0001,050,0002,113,536
5Jul 17, 2026 00:483,81041,407,73730,571,0001,052,0002,113,536
6Jul 17, 2026 00:483,82142,944,37330,672,0001,048,0002,113,536
7Jul 17, 2026 00:483,97142,703,28731,916,0001,049,0002,113,536
8Jul 17, 2026 00:484,03143,177,02332,416,0001,045,0002,113,536
9Jul 17, 2026 00:484,03843,331,58532,473,0001,046,0002,113,536