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:25highload-churnerhighload-churnerScore: 53,762Success
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:2553,623454,036,724444,042,0001,037,0002,117,632stderr
2Oct 13, 2026 02:2553,638454,172,096444,125,0001,076,0002,117,632stderr
3Oct 13, 2026 02:2553,701454,876,935444,619,0001,106,0002,117,632stderr
4Oct 13, 2026 02:2553,730454,958,807444,893,0001,072,0002,117,632stderr
5Oct 13, 2026 02:2553,762455,224,991445,187,0001,042,0002,117,632stderr
6Oct 13, 2026 02:2553,789455,893,219445,415,0001,039,0002,117,632stderr
7Oct 13, 2026 02:2553,806455,420,128445,565,0001,030,0002,117,632stderr
8Oct 13, 2026 02:2553,871456,579,358446,098,0001,035,0002,117,632stderr
9Oct 13, 2026 02:2553,919457,150,289446,479,0001,055,0002,117,632stderr