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 11, 2026 00:44Victor MerckléVictor MerckléScore: 3,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 00:453,83640,301,77130,672,0001,172,0002,117,632stderr
2Aug 11, 2026 00:453,87440,573,00931,000,0001,156,0002,117,632stderr
3Aug 11, 2026 00:453,89641,352,27531,165,0001,177,0002,117,632stderr
4Aug 11, 2026 00:453,90240,716,98231,225,0001,168,0002,117,632stderr
5Aug 11, 2026 00:453,90940,890,56131,291,0001,161,0002,117,632stderr
6Aug 11, 2026 00:453,91240,802,75731,381,0001,096,0002,117,632stderr
7Aug 11, 2026 00:453,91540,771,15231,306,0001,190,0002,117,632stderr
8Aug 11, 2026 00:453,93541,657,22331,479,0001,182,0002,117,632stderr
9Aug 11, 2026 00:453,93740,984,93231,515,0001,169,0002,117,632stderr