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 18, 2026 12:33Kevin HeaveyKevin HeaveyScore: 3,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:413,66640,250,72529,384,0001,048,0002,113,536
2Jul 18, 2026 12:413,68240,331,07029,513,0001,048,0002,113,536
3Jul 18, 2026 12:413,68440,335,57829,531,0001,054,0002,113,536
4Jul 18, 2026 12:413,75741,029,31530,139,0001,048,0002,113,536
5Jul 18, 2026 12:413,96142,654,71431,839,0001,042,0002,113,536
6Jul 18, 2026 12:413,96752,463,88431,890,0001,042,0002,113,536
7Jul 18, 2026 12:414,01743,177,22732,303,0001,042,0002,113,536
8Jul 18, 2026 12:414,14055,519,10533,321,0001,044,0002,113,536
9Jul 18, 2026 12:415,00863,654,44240,269,0001,302,0002,113,536