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 13:25Victor MerckléVictor MerckléScore: 3,781Success
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 13:263,74639,582,29529,955,0001,138,0002,117,632stderr
2Aug 25, 2026 13:263,74739,476,64930,008,0001,096,0002,117,632stderr
3Aug 25, 2026 13:263,75739,566,26630,063,0001,127,0002,117,632stderr
4Aug 25, 2026 13:263,76239,616,62330,149,0001,079,0002,117,632stderr
5Aug 25, 2026 13:263,78139,749,45530,196,0001,193,0002,117,632stderr
6Aug 25, 2026 13:263,78439,788,96730,275,0001,135,0002,117,632stderr
7Aug 25, 2026 13:263,79339,884,72930,336,0001,146,0002,117,632stderr
8Aug 25, 2026 13:263,79439,936,58330,315,0001,183,0002,117,632stderr
9Aug 25, 2026 13:263,81140,191,95930,554,0001,085,0002,117,632stderr