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 12, 2026 05:41Victor MerckléVictor MerckléScore: 3,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:423,82140,131,20730,598,0001,120,0002,117,632stderr
2Aug 12, 2026 05:423,82640,145,51830,655,0001,105,0002,117,632stderr
3Aug 12, 2026 05:423,84440,349,38130,713,0001,193,0002,117,632stderr
4Aug 12, 2026 05:423,87540,546,73431,096,0001,071,0002,117,632stderr
5Aug 12, 2026 05:423,89241,448,54931,128,0001,180,0002,117,632stderr
6Aug 12, 2026 05:423,90940,847,99131,359,0001,092,0002,117,632stderr
7Aug 12, 2026 05:423,96241,275,43731,848,0001,041,0002,117,632stderr
8Aug 12, 2026 05:423,98841,471,59132,026,0001,078,0002,117,632stderr
9Aug 12, 2026 05:424,09942,498,49632,955,0001,072,0002,117,632stderr