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 listJun 23, 2026 20:49Victor MerckléVictor MerckléScore: 63,594Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 20:5062,88630,948,42323,268,00002,113,536
2Jun 23, 2026 20:5063,35430,853,22123,441,00002,113,536
3Jun 23, 2026 20:5063,46431,564,09023,482,00002,113,536
4Jun 23, 2026 20:5063,52130,913,98623,503,00002,113,536
5Jun 23, 2026 20:5063,59430,962,34623,530,00002,113,536
6Jun 23, 2026 20:5063,69731,358,29823,568,00002,113,536
7Jun 23, 2026 20:5063,71331,343,18923,574,00002,113,536
8Jun 23, 2026 20:5063,78631,229,79423,601,00002,113,536
9Jun 23, 2026 20:5064,40031,514,51923,828,00002,113,536