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 24, 2026 20:45Kevin HeaveyKevin HeaveyScore: 3,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 20:483,58339,531,29628,617,0001,124,0002,113,536
2Jul 24, 2026 20:483,61439,993,79728,836,0001,161,0002,113,536
3Jul 24, 2026 20:483,62139,990,40228,933,0001,128,0002,113,536
4Jul 24, 2026 20:483,71340,701,56429,639,0001,185,0002,113,536
5Jul 24, 2026 20:483,81441,471,08830,521,0001,136,0002,113,536
6Jul 24, 2026 20:483,83441,687,31130,686,0001,137,0002,113,536
7Jul 24, 2026 20:483,84642,321,74030,756,0001,172,0002,113,536
8Jul 24, 2026 20:483,86141,846,79830,930,0001,118,0002,113,536
9Jul 24, 2026 20:483,86241,957,56230,894,0001,165,0002,113,536