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:49highload-churnerhighload-churnerScore: 580,097Success
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:50578,316222,910,515211,967,0002,010,00028,672stderr
2Oct 13, 2026 08:50578,886223,132,602212,120,0002,068,00028,672stderr
3Oct 13, 2026 08:50579,064223,163,376212,135,0002,119,00028,672stderr
4Oct 13, 2026 08:50579,772223,461,136212,355,0002,161,00028,672stderr
5Oct 13, 2026 08:50580,097224,089,784212,573,0002,063,00024,576stderr
6Oct 13, 2026 08:50580,613223,629,717213,675,0001,152,00028,672stderr
7Oct 13, 2026 08:50580,637223,654,568212,664,0002,172,00028,672stderr
8Oct 13, 2026 08:50581,245223,951,595213,036,0002,025,00028,672stderr
9Oct 13, 2026 08:50581,991224,125,470213,152,0002,185,00024,576stderr