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 15:25Victor MerckléVictor MerckléScore: 3,771Success
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 15:263,74239,571,15529,924,0001,135,0002,117,632stderr
2Aug 12, 2026 15:263,76639,668,02630,095,0001,169,0002,117,632stderr
3Aug 12, 2026 15:263,76939,672,06830,132,0001,152,0002,117,632stderr
4Aug 12, 2026 15:263,77039,687,39930,176,0001,117,0002,117,632stderr
5Aug 12, 2026 15:263,77139,708,44630,139,0001,164,0002,117,632stderr
6Aug 12, 2026 15:263,77339,714,94830,247,0001,071,0002,117,632stderr
7Aug 12, 2026 15:263,77539,755,62430,226,0001,113,0002,117,632stderr
8Aug 12, 2026 15:263,79040,553,14230,344,0001,121,0002,117,632stderr
9Aug 12, 2026 15:263,81340,088,17330,575,0001,081,0002,117,632stderr