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 19, 2026 15:29Kevin HeaveyKevin HeaveyScore: 10,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 15:3010,37695,765,19384,990,0001,131,0002,113,536
2Jul 19, 2026 15:3010,39995,904,32285,188,0001,129,0002,113,536
3Jul 19, 2026 15:3010,44896,323,76485,591,0001,134,0002,113,536
4Jul 19, 2026 15:3010,45796,379,51285,657,0001,143,0002,113,536
5Jul 19, 2026 15:3010,45996,389,80585,695,0001,116,0002,113,536
6Jul 19, 2026 15:3010,46296,417,20785,705,0001,130,0002,113,536
7Jul 19, 2026 15:3010,47096,547,99985,766,0001,143,0002,113,536
8Jul 19, 2026 15:3010,47096,597,47985,777,0001,130,0002,113,536
9Jul 19, 2026 15:3010,47396,527,49385,790,0001,139,0002,113,536