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:35highload-churnerhighload-churnerScore: 3,459Success
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:353,30939,085,78227,467,000020,480
2Oct 13, 2026 00:353,32037,650,76127,557,000020,480
3Oct 13, 2026 00:353,40237,162,86728,239,000020,480
4Oct 13, 2026 00:353,40437,020,73728,259,000020,480
5Oct 13, 2026 00:353,45937,525,87728,715,000020,480
6Oct 13, 2026 00:353,46938,344,49328,798,000020,480
7Oct 13, 2026 00:353,47337,581,11028,827,000020,480
8Oct 13, 2026 00:353,48040,031,87327,861,0001,028,00020,480
9Oct 13, 2026 00:353,54738,955,97429,443,000020,480