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 10, 2026 15:36Victor MerckléVictor MerckléScore: 6,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 15:375,98858,089,37048,600,0001,103,0002,117,632stderr
2Aug 10, 2026 15:375,99157,966,36048,590,0001,143,0002,117,632stderr
3Aug 10, 2026 15:375,99357,962,79548,632,0001,111,0002,117,632stderr
4Aug 10, 2026 15:375,99557,988,16348,635,0001,130,0002,117,632stderr
5Aug 10, 2026 15:376,03458,321,22748,980,0001,110,0002,117,632stderr
6Aug 10, 2026 15:376,04958,360,83249,173,0001,039,0002,117,632stderr
7Aug 10, 2026 15:376,05058,389,81849,176,0001,047,0002,117,632stderr
8Aug 10, 2026 15:376,06560,070,98749,331,0001,009,0002,117,632stderr
9Aug 10, 2026 15:376,07958,643,50149,442,0001,016,0002,117,632stderr