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 22, 2026 17:17Kevin HeaveyKevin HeaveyScore: 3,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 17:173,53139,044,09928,196,0001,117,0002,113,536
2Jul 22, 2026 17:173,55639,253,58528,400,0001,117,0002,113,536
3Jul 22, 2026 17:173,56839,378,52628,477,0001,143,0002,113,536
4Jul 22, 2026 17:173,69640,424,14229,541,0001,144,0002,113,536
5Jul 22, 2026 17:173,74340,776,00729,954,0001,113,0002,113,536
6Jul 22, 2026 17:173,81441,386,05830,526,0001,132,0002,113,536
7Jul 22, 2026 17:173,81742,157,04130,517,0001,165,0002,113,536
8Jul 22, 2026 17:173,84741,659,34930,843,0001,095,0002,113,536
9Jul 22, 2026 17:1763,937540,420,963529,596,0001,082,0002,113,536