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 22:29Victor MerckléVictor MerckléScore: 10,249Success
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 22:2910,23596,512,94783,851,0001,100,0002,113,536
2May 11, 2026 22:2910,24494,824,32083,858,0001,170,0002,113,536
3May 11, 2026 22:2910,24895,660,71283,885,0001,180,0002,113,536
4May 11, 2026 22:2910,24894,111,18683,877,0001,183,0002,113,536
5May 11, 2026 22:2910,24995,152,90383,887,0001,183,0002,113,536
6May 11, 2026 22:2910,25095,676,66383,885,0001,194,0002,113,536
7May 11, 2026 22:2910,25493,854,00484,107,0001,006,0002,113,536
8May 11, 2026 22:2910,25695,528,12084,127,0001,003,0002,113,536
9May 11, 2026 22:2910,27394,899,11984,125,0001,143,0002,113,536