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 listSep 8, 2026 06:18Victor MerckléVictor MerckléScore: 3,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 06:233,56038,095,24828,449,0001,100,00024,576stderr
2Sep 8, 2026 06:233,56238,126,60128,432,0001,133,00024,576stderr
3Sep 8, 2026 06:233,61340,565,32328,978,0001,014,00024,576stderr
4Sep 8, 2026 06:233,62738,600,78029,085,0001,026,00024,576stderr
5Sep 8, 2026 06:233,64338,707,41029,173,0001,064,00024,576stderr
6Sep 8, 2026 06:233,64538,720,59829,191,0001,065,0002,117,632stderr
7Sep 8, 2026 06:233,64939,432,03629,235,0001,054,00024,576stderr
8Sep 8, 2026 06:233,65439,614,88429,220,0001,111,0002,117,632stderr
9Sep 8, 2026 06:233,67439,831,41129,082,0001,418,00024,576stderr