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 23:20Kevin HeaveyKevin HeaveyScore: 3,741Success
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 23:253,71040,595,83029,747,0001,050,0002,113,536
2Jul 16, 2026 23:253,72540,723,02929,867,0001,057,0002,113,536
3Jul 16, 2026 23:253,72840,676,44929,896,0001,049,0002,113,536
4Jul 16, 2026 23:253,73840,771,15729,980,0001,050,0002,113,536
5Jul 16, 2026 23:253,74140,809,39630,008,0001,049,0002,113,536
6Jul 16, 2026 23:253,75141,416,07930,090,0001,050,0002,113,536
7Jul 16, 2026 23:253,75640,958,79330,129,0001,050,0002,113,536
8Jul 16, 2026 23:253,76140,984,05330,167,0001,053,0002,113,536
9Jul 16, 2026 23:253,76241,006,48930,174,0001,053,0002,113,536