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 00:23highload-churnerhighload-churnerScore: 3,457Success
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 00:243,29836,166,74927,375,000020,480
2Oct 13, 2026 00:243,31836,368,72427,544,000020,480
3Oct 13, 2026 00:243,34536,726,75227,765,000020,480
4Oct 13, 2026 00:243,44537,674,81728,599,000020,480
5Oct 13, 2026 00:243,45738,209,90528,700,000020,480
6Oct 13, 2026 00:243,49337,977,00728,995,000020,480
7Oct 13, 2026 00:243,49837,877,69329,040,000020,480
8Oct 13, 2026 00:243,50338,622,31129,077,000020,480
9Oct 13, 2026 00:243,52238,140,49629,235,000020,480