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:41highload-churnerhighload-churnerScore: 42,248Success
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:4242,075358,207,643348,162,0001,067,0002,117,632stderr
2Oct 13, 2026 02:4242,117358,965,637348,492,0001,082,0002,117,632stderr
3Oct 13, 2026 02:4242,135358,815,053348,714,0001,008,0002,117,632stderr
4Oct 13, 2026 02:4242,236360,081,016349,559,0001,004,0002,117,632stderr
5Oct 13, 2026 02:4242,248359,716,950349,639,0001,027,0002,117,632stderr
6Oct 13, 2026 02:4242,272359,942,376349,717,0001,146,0002,117,632stderr
7Oct 13, 2026 02:4242,294360,011,606349,987,0001,060,0002,117,632stderr
8Oct 13, 2026 02:4242,320360,218,277350,210,0001,049,0002,117,632stderr
9Oct 13, 2026 02:4242,443361,332,389351,222,0001,060,0002,117,632stderr