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 5, 2026 13:25Victor MerckléVictor MerckléScore: 64,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:2664,19132,837,74522,710,0001,041,0002,113,536
2Jun 5, 2026 13:2664,25132,812,48022,647,0001,126,0002,113,536
3Jun 5, 2026 13:2664,30532,852,40422,666,0001,127,0002,113,536
4Jun 5, 2026 13:2664,47532,969,86522,723,0001,133,0002,113,536
5Jun 5, 2026 13:2664,49432,885,51322,729,0001,134,0002,113,536
6Jun 5, 2026 13:2664,64034,603,27422,845,0001,072,0002,113,536
7Jun 5, 2026 13:2664,80233,073,87622,851,0001,126,0002,113,536
8Jun 5, 2026 13:2664,86233,097,26422,833,0001,166,0002,113,536
9Jun 5, 2026 13:2664,87833,072,39622,862,0001,143,0002,113,536