TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listOct 13, 2026 08:27highload-churnerhighload-churnerScore: 1,619,705Success
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 08:291,616,243606,967,210595,997,0002,013,00024,576stderr
2Oct 13, 2026 08:291,617,110607,862,647596,219,0002,112,00024,576stderr
3Oct 13, 2026 08:291,618,064609,819,118596,596,0002,088,00028,672stderr
4Oct 13, 2026 08:291,619,527608,383,797597,215,0002,010,00028,672stderr
5Oct 13, 2026 08:291,619,705608,226,196597,132,0002,159,00024,576stderr
6Oct 13, 2026 08:291,619,959608,366,266597,210,0002,175,00028,672stderr
7Oct 13, 2026 08:291,623,456611,196,994598,643,0002,036,00024,576stderr
8Oct 13, 2026 08:291,623,700609,606,603598,749,0002,020,00024,576stderr
9Oct 13, 2026 08:291,624,035609,811,857598,854,0002,039,00024,576stderr