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 12, 2026 11:41Victor MerckléVictor MerckléScore: 10,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 11:4210,08792,898,44482,627,0001,100,0002,113,536
2May 12, 2026 11:4210,10093,551,81482,662,0001,175,0002,113,536
3May 12, 2026 11:4210,10093,549,84682,644,0001,191,0002,113,536
4May 12, 2026 11:4210,10194,395,69682,667,0001,172,0002,113,536
5May 12, 2026 11:4210,10194,813,41982,662,0001,182,0002,113,536
6May 12, 2026 11:4210,10695,354,21382,712,0001,173,0002,113,536
7May 12, 2026 11:4210,10893,127,82182,714,0001,183,0002,113,536
8May 12, 2026 11:4210,11193,725,29382,924,0001,004,0002,113,536
9May 12, 2026 11:4210,11595,572,34882,775,0001,187,0002,113,536