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:58highload-churnerhighload-churnerScore: 580,245Success
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:59578,094222,728,164212,733,0001,162,00024,576stderr
2Oct 13, 2026 08:59578,251222,794,128211,792,0002,161,00024,576stderr
3Oct 13, 2026 08:59578,813223,032,883212,098,0002,063,00028,672stderr
4Oct 13, 2026 08:59579,670223,344,812212,437,0002,041,00024,576stderr
5Oct 13, 2026 08:59580,245223,542,105212,644,0002,047,00024,576stderr
6Oct 13, 2026 08:59580,251224,144,250212,656,0002,037,00024,576stderr
7Oct 13, 2026 08:59580,902223,776,851212,880,0002,054,00028,672stderr
8Oct 13, 2026 08:59581,413223,938,464213,081,0002,042,00024,576stderr
9Oct 13, 2026 08:59581,813224,261,416213,226,0002,045,00024,576stderr