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 listAug 25, 2026 11:01Victor MerckléVictor MerckléScore: 3,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 11:023,95141,120,10431,563,0001,234,0002,117,632stderr
2Aug 25, 2026 11:023,95841,453,62531,667,0001,190,0002,117,632stderr
3Aug 25, 2026 11:023,96041,935,24731,674,0001,196,0002,117,632stderr
4Aug 25, 2026 11:023,96541,240,21231,711,0001,205,0002,117,632stderr
5Aug 25, 2026 11:023,96941,254,60131,802,0001,141,0002,117,632stderr
6Aug 25, 2026 11:023,97441,349,30331,834,0001,151,0002,117,632stderr
7Aug 25, 2026 11:024,00841,568,27832,159,0001,113,0002,117,632stderr
8Aug 25, 2026 11:024,01741,674,81932,183,0001,163,0002,117,632stderr
9Aug 25, 2026 11:024,05041,977,59732,494,0001,127,0002,117,632stderr