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 13, 2026 23:32Victor MerckléVictor MerckléScore: 7,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:327,56673,077,43762,800,00002,113,536
2May 13, 2026 23:327,56772,361,38461,812,0001,002,0002,113,536
3May 13, 2026 23:327,57072,240,71361,832,0001,004,0002,113,536
4May 13, 2026 23:327,57373,093,19161,823,0001,034,0002,113,536
5May 13, 2026 23:327,57470,381,52761,865,0001,006,0002,113,536
6May 13, 2026 23:327,57570,982,21862,874,00002,113,536
7May 13, 2026 23:327,57972,035,39461,862,0001,045,0002,113,536
8May 13, 2026 23:327,58071,990,43361,887,0001,035,0002,113,536
9May 13, 2026 23:327,68472,851,97262,781,0001,001,0002,113,536