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 21:05Kevin 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 16, 2026 21:093,78241,160,18930,368,0001,027,0002,113,536
2Jul 16, 2026 21:093,79741,274,56330,491,0001,025,0002,113,536
3Jul 16, 2026 21:093,80341,713,05330,543,0001,029,0002,113,536
4Jul 16, 2026 21:093,80741,310,54930,575,0001,027,0002,113,536
5Jul 16, 2026 21:093,81441,853,75230,553,0001,108,0002,113,536
6Jul 16, 2026 21:093,85841,807,83430,900,0001,129,0002,113,536
7Jul 16, 2026 21:093,86441,873,32931,029,0001,046,0002,113,536
8Jul 16, 2026 21:093,86942,592,50531,068,0001,050,0002,113,536
9Jul 16, 2026 21:093,88743,226,80531,216,0001,049,0002,113,536