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 15:15Victor MerckléVictor MerckléScore: 7,381Success
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 15:157,33069,836,77559,743,0001,096,0002,117,632stderr
2Aug 25, 2026 15:157,34769,328,04559,936,0001,047,0002,117,632stderr
3Aug 25, 2026 15:157,36069,394,54959,996,0001,095,0002,117,632stderr
4Aug 25, 2026 15:157,36769,464,15660,135,0001,013,0002,117,632stderr
5Aug 25, 2026 15:157,38169,641,98360,227,0001,040,0002,117,632stderr
6Aug 25, 2026 15:157,39169,647,19060,305,0001,046,0002,117,632stderr
7Aug 25, 2026 15:157,39269,660,59960,273,0001,088,0002,117,632stderr
8Aug 25, 2026 15:157,39569,715,67160,278,0001,106,0002,117,632stderr
9Aug 25, 2026 15:157,56471,072,31061,688,0001,094,0002,117,632stderr