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 24, 2026 23:49Victor MerckléVictor MerckléScore: 3,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:503,85140,380,13030,831,0001,140,0002,117,632stderr
2Aug 24, 2026 23:503,86540,504,86030,964,0001,119,0002,117,632stderr
3Aug 24, 2026 23:503,86940,540,22231,030,0001,088,0002,117,632stderr
4Aug 24, 2026 23:503,88441,319,21831,110,0001,131,0002,117,632stderr
5Aug 24, 2026 23:503,88540,650,20331,172,0001,080,0002,117,632stderr
6Aug 24, 2026 23:503,89240,858,54331,068,0001,241,0002,117,632stderr
7Aug 24, 2026 23:503,89640,615,19431,204,0001,134,0002,117,632stderr
8Aug 24, 2026 23:504,08042,858,67132,748,0001,124,0002,117,632stderr
9Aug 24, 2026 23:504,13942,748,44533,234,0001,125,0002,117,632stderr