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 12:05Victor MerckléVictor MerckléScore: 3,814Success
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 12:053,79139,919,75230,280,0001,188,0002,117,632stderr
2Aug 12, 2026 12:053,79739,934,27130,423,0001,096,0002,117,632stderr
3Aug 12, 2026 12:053,80139,993,15430,390,0001,164,0002,117,632stderr
4Aug 12, 2026 12:053,80640,026,27730,437,0001,160,0002,117,632stderr
5Aug 12, 2026 12:053,81440,081,10130,572,0001,086,0002,117,632stderr
6Aug 12, 2026 12:053,81740,093,07430,530,0001,158,0002,117,632stderr
7Aug 12, 2026 12:053,84640,336,22230,856,0001,069,0002,117,632stderr
8Aug 12, 2026 12:053,86840,555,27130,965,0001,144,0002,117,632stderr
9Aug 12, 2026 12:053,98341,499,38731,992,0001,071,0002,117,632stderr