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 listMay 19, 2026 14:43Victor MerckléVictor MerckléScore: 8,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:448,08176,555,99466,071,0001,003,0002,113,536
2May 19, 2026 14:448,08576,749,92966,104,0001,007,0002,113,536
3May 19, 2026 14:448,10974,934,02066,299,0001,011,0002,113,536
4May 19, 2026 14:448,16677,455,19466,745,0001,041,0002,113,536
5May 19, 2026 14:448,27977,080,80367,684,0001,036,0002,113,536
6May 19, 2026 14:448,28177,317,47267,702,0001,038,0002,113,536
7May 19, 2026 14:448,28377,175,81567,719,0001,034,0002,113,536
8May 19, 2026 14:448,30080,201,20367,888,0001,008,0002,113,536
9May 19, 2026 14:448,35780,036,45868,355,0001,010,0002,113,536