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 11:43highload-churnerhighload-churnerScore: 3,405Success
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 11:443,27236,015,91827,161,000020,480
2Oct 13, 2026 11:443,27736,015,66027,200,000020,480
3Oct 13, 2026 11:443,28736,173,85027,287,000020,480
4Oct 13, 2026 11:443,38937,005,27128,135,000020,480
5Oct 13, 2026 11:443,40537,095,47728,267,000020,480
6Oct 13, 2026 11:443,46738,197,29328,780,000020,480
7Oct 13, 2026 11:443,47037,621,34228,802,000020,480
8Oct 13, 2026 11:443,47437,675,44928,840,000020,480
9Oct 13, 2026 11:443,49237,977,54828,991,000020,480