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 00:00Victor MerckléVictor MerckléScore: 3,836Success
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 00:013,79939,846,10030,416,0001,118,0002,117,632stderr
2Aug 25, 2026 00:013,80040,596,93030,385,0001,159,0002,117,632stderr
3Aug 25, 2026 00:013,80239,945,35830,405,0001,158,0002,117,632stderr
4Aug 25, 2026 00:013,82840,223,48930,643,0001,132,0002,117,632stderr
5Aug 25, 2026 00:013,83640,294,64630,754,0001,086,0002,117,632stderr
6Aug 25, 2026 00:013,89340,676,12331,220,0001,092,0002,117,632stderr
7Aug 25, 2026 00:013,98541,537,54032,020,0001,060,0002,117,632stderr
8Aug 25, 2026 00:013,99041,516,47532,052,0001,070,0002,117,632stderr
9Aug 25, 2026 00:014,05242,094,74632,578,0001,055,0002,117,632stderr