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 23:18Victor MerckléVictor MerckléScore: 3,786Success
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 23:193,73339,458,19629,838,0001,154,0002,117,632stderr
2Aug 12, 2026 23:193,77039,699,69730,174,0001,120,0002,117,632stderr
3Aug 12, 2026 23:193,77739,740,08130,270,0001,083,0002,117,632stderr
4Aug 12, 2026 23:193,78239,819,63530,249,0001,146,0002,117,632stderr
5Aug 12, 2026 23:193,78640,071,77530,317,0001,107,0002,117,632stderr
6Aug 12, 2026 23:193,81040,117,37330,471,0001,153,0002,117,632stderr
7Aug 12, 2026 23:193,82240,126,35330,637,0001,093,0002,117,632stderr
8Aug 12, 2026 23:193,83640,219,63730,740,0001,102,0002,117,632stderr
9Aug 12, 2026 23:194,04141,967,77232,421,0001,120,0002,117,632stderr