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 13:07highload-churnerhighload-churnerScore: 19,313Success
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 13:0819,253168,955,956159,801,000024,576stderr
2Oct 14, 2026 13:0819,297169,603,719160,171,000024,576stderr
3Oct 14, 2026 13:0819,305169,237,207160,235,000024,576stderr
4Oct 14, 2026 13:0819,310169,612,207159,261,0001,018,00024,576stderr
5Oct 14, 2026 13:0819,313169,555,972159,286,0001,015,00024,576stderr
6Oct 14, 2026 13:0819,338170,104,985160,510,000024,576stderr
7Oct 14, 2026 13:0819,356170,091,203159,647,0001,008,00024,576stderr
8Oct 14, 2026 13:0819,382169,815,722160,878,000024,576stderr
9Oct 14, 2026 13:0819,392169,999,845160,955,000024,576stderr