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 11, 2026 22:06Victor MerckléVictor MerckléScore: 4,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 22:074,41044,955,92235,506,0001,102,0002,117,632stderr
2Aug 11, 2026 22:074,41645,015,41935,533,0001,121,0002,117,632stderr
3Aug 11, 2026 22:074,41845,088,51935,567,0001,110,0002,117,632stderr
4Aug 11, 2026 22:074,43044,949,48935,729,0001,043,0002,117,632stderr
5Aug 11, 2026 22:074,43645,207,67035,726,0001,100,0002,117,632stderr
6Aug 11, 2026 22:074,44545,303,72435,800,0001,100,0002,117,632stderr
7Aug 11, 2026 22:074,49045,660,19736,163,0001,105,0002,117,632stderr
8Aug 11, 2026 22:074,59046,478,24836,990,0001,107,0002,117,632stderr
9Aug 11, 2026 22:074,66047,045,48137,588,0001,095,0002,117,632stderr