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 09:48Victor MerckléVictor MerckléScore: 6,151Success
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 09:506,09858,750,79149,619,0001,002,0002,113,536
2May 19, 2026 09:506,09959,344,83749,621,0001,006,0002,113,536
3May 19, 2026 09:506,10960,255,81349,682,0001,026,0002,113,536
4May 19, 2026 09:506,14558,772,69349,982,0001,028,0002,113,536
5May 19, 2026 09:506,15160,431,82650,035,0001,023,0002,113,536
6May 19, 2026 09:506,16459,085,61950,134,0001,031,0002,113,536
7May 19, 2026 09:506,16458,991,87450,132,0001,036,0002,113,536
8May 19, 2026 09:506,23959,788,72750,765,0001,026,0002,113,536
9May 19, 2026 09:506,31360,155,06651,399,0001,003,0002,113,536