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 14, 2026 15:24highload-churnerhighload-churnerScore: 21,784Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 15:2521,730189,737,349180,364,000024,576stderr
2Oct 14, 2026 15:2521,736189,503,012180,416,000024,576stderr
3Oct 14, 2026 15:2521,737189,873,956180,425,000024,576stderr
4Oct 14, 2026 15:2521,742189,619,935179,425,0001,040,00024,576stderr
5Oct 14, 2026 15:2521,784190,257,173180,815,000024,576stderr
6Oct 14, 2026 15:2521,794190,437,906180,898,000024,576stderr
7Oct 14, 2026 15:2521,812190,554,396181,043,000024,576stderr
8Oct 14, 2026 15:2521,820190,522,635181,114,000024,576stderr
9Oct 14, 2026 15:2521,855190,879,853180,381,0001,019,00024,576stderr