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 listSep 11, 2026 19:31Victor MerckléVictor MerckléScore: 10,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 19:3410,20693,527,84182,101,0002,612,00024,576stderr
2Sep 11, 2026 19:3410,26293,899,95782,295,0002,884,0002,117,632stderr
3Sep 11, 2026 19:3410,27593,961,67782,276,0003,010,00024,576stderr
4Sep 11, 2026 19:3410,31694,327,18584,053,0001,574,00024,576stderr
5Sep 11, 2026 19:3410,32895,142,79682,781,0002,948,0002,117,632stderr
6Sep 11, 2026 19:3410,33994,458,57782,896,0002,918,0002,117,632stderr
7Sep 11, 2026 19:3410,35194,626,20082,950,0002,968,0002,117,632stderr
8Sep 11, 2026 19:3410,35394,623,86582,992,0002,940,0002,117,632stderr
9Sep 11, 2026 19:3410,39095,658,03883,088,0003,150,0002,117,632stderr