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 23, 2026 18:43Victor MerckléVictor MerckléScore: 3,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:443,74239,442,41429,937,0001,128,0002,117,632stderr
2Aug 23, 2026 18:443,75239,522,64030,022,0001,124,0002,117,632stderr
3Aug 23, 2026 18:443,76239,634,30430,109,0001,117,0002,117,632stderr
4Aug 23, 2026 18:443,76839,694,29230,126,0001,154,0002,117,632stderr
5Aug 23, 2026 18:443,77940,219,45630,240,0001,129,0002,117,632stderr
6Aug 23, 2026 18:443,79839,970,44730,437,0001,092,0002,117,632stderr
7Aug 23, 2026 18:443,82140,046,98730,608,0001,108,0002,117,632stderr
8Aug 23, 2026 18:443,82540,096,07830,676,0001,074,0002,117,632stderr
9Aug 23, 2026 18:444,00942,189,07032,197,0001,080,0002,117,632stderr