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 12, 2026 15:45Victor MerckléVictor MerckléScore: 3,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 15:463,73639,438,54029,876,0001,138,0002,117,632stderr
2Aug 12, 2026 15:463,73639,619,35029,832,0001,183,0002,117,632stderr
3Aug 12, 2026 15:463,74939,482,65130,008,0001,112,0002,117,632stderr
4Aug 12, 2026 15:463,77239,724,42830,234,0001,079,0002,117,632stderr
5Aug 12, 2026 15:463,77439,780,55830,235,0001,092,0002,117,632stderr
6Aug 12, 2026 15:463,78039,783,88430,306,0001,068,0002,117,632stderr
7Aug 12, 2026 15:463,78239,884,03530,268,0001,126,0002,117,632stderr
8Aug 12, 2026 15:463,79339,897,12230,354,0001,130,0002,117,632stderr
9Aug 12, 2026 15:463,81240,100,44330,430,0001,211,0002,117,632stderr