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:24highload-churnerhighload-churnerScore: 1,620,264Success
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:251,617,272607,380,040596,213,0002,178,00024,576stderr
2Oct 13, 2026 08:251,617,364607,566,149596,229,0002,196,00024,576stderr
3Oct 13, 2026 08:251,619,124608,671,808597,072,0002,004,00024,576stderr
4Oct 13, 2026 08:251,619,805608,234,126597,283,0002,045,00028,672stderr
5Oct 13, 2026 08:251,620,264608,511,423597,487,0002,011,00024,576stderr
6Oct 13, 2026 08:251,621,018608,796,554597,618,0002,159,00024,576stderr
7Oct 13, 2026 08:251,623,132609,443,504598,383,0002,176,00028,672stderr
8Oct 13, 2026 08:251,623,497609,659,351598,662,0002,032,00024,576stderr
9Oct 13, 2026 08:251,623,613610,271,619598,723,0002,014,00024,576stderr