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 10, 2026 14:06Victor MerckléVictor MerckléScore: 63,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 14:0762,48330,693,67223,119,00002,113,536
2Jun 10, 2026 14:0762,74830,605,81923,217,00002,113,536
3Jun 10, 2026 14:0762,88330,959,12723,267,00002,113,536
4Jun 10, 2026 14:0763,01831,238,60323,317,00002,113,536
5Jun 10, 2026 14:0763,33530,933,45223,434,00002,113,536
6Jun 10, 2026 14:0763,36731,297,11923,446,00002,113,536
7Jun 10, 2026 14:0763,39131,099,77823,455,00002,113,536
8Jun 10, 2026 14:0763,53731,322,19123,509,00002,113,536
9Jun 10, 2026 14:0763,85931,150,79223,628,00002,113,536