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:45Victor MerckléVictor MerckléScore: 3,785Success
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:463,76241,717,95630,076,0001,151,0002,117,632stderr
2Aug 25, 2026 13:463,76839,713,42930,186,0001,094,0002,117,632stderr
3Aug 25, 2026 13:463,77639,717,37630,255,0001,089,0002,117,632stderr
4Aug 25, 2026 13:463,77839,746,90930,281,0001,080,0002,117,632stderr
5Aug 25, 2026 13:463,78539,827,77830,280,0001,138,0002,117,632stderr
6Aug 25, 2026 13:463,80240,003,80930,472,0001,089,0002,117,632stderr
7Aug 25, 2026 13:463,80340,029,75130,443,0001,129,0002,117,632stderr
8Aug 25, 2026 13:463,82540,138,70330,650,0001,099,0002,117,632stderr
9Aug 25, 2026 13:463,84540,296,32930,801,0001,113,0002,117,632stderr