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 11, 2026 16:48Victor MerckléVictor MerckléScore: 10,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:4810,23293,698,46983,831,0001,096,0002,113,536
2May 11, 2026 16:4810,23394,505,40483,818,0001,124,0002,113,536
3May 11, 2026 16:4810,24394,800,59383,820,0001,198,0002,113,536
4May 11, 2026 16:4810,24595,463,78083,866,0001,168,0002,113,536
5May 11, 2026 16:4810,24794,257,52884,032,0001,021,0002,113,536
6May 11, 2026 16:4810,25196,829,04084,080,0001,006,0002,113,536
7May 11, 2026 16:4810,25196,446,53183,923,0001,164,0002,113,536
8May 11, 2026 16:4810,25294,785,64783,895,0001,201,0002,113,536
9May 11, 2026 16:4810,26896,343,54084,066,0001,164,0002,113,536