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 11, 2026 09:50Victor MerckléVictor MerckléScore: 62,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 09:5162,47830,579,43123,117,00002,113,536
2Jun 11, 2026 09:5162,50030,652,72723,125,00002,113,536
3Jun 11, 2026 09:5162,75430,749,58623,219,00002,113,536
4Jun 11, 2026 09:5162,80830,798,97823,239,00002,113,536
5Jun 11, 2026 09:5162,87830,782,20023,265,00002,113,536
6Jun 11, 2026 09:5162,95930,851,15023,295,00002,113,536
7Jun 11, 2026 09:5163,51631,032,92423,501,00002,113,536
8Jun 11, 2026 09:5163,57831,055,96323,524,00002,113,536
9Jun 11, 2026 09:5163,78331,185,05323,600,00002,113,536