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 listOct 13, 2026 02:33highload-churnerhighload-churnerScore: 74,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 02:3474,035624,003,410613,487,0001,006,0002,117,632stderr
2Oct 13, 2026 02:3474,042624,119,833613,523,0001,030,0002,117,632stderr
3Oct 13, 2026 02:3474,129624,837,285614,249,0001,027,0002,117,632stderr
4Oct 13, 2026 02:3474,134625,279,397614,275,0001,040,0002,117,632stderr
5Oct 13, 2026 02:3474,230625,590,672615,082,0001,028,0002,117,632stderr
6Oct 13, 2026 02:3474,233625,618,423615,016,0001,123,0002,117,632stderr
7Oct 13, 2026 02:3474,237625,571,803615,143,0001,028,0002,117,632stderr
8Oct 13, 2026 02:3474,271625,383,443615,422,0001,029,0002,117,632stderr
9Oct 13, 2026 02:3474,447628,900,144616,845,0001,070,0002,117,632stderr