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 18, 2026 15:47Victor MerckléVictor MerckléScore: 62,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 15:4862,53731,839,29823,139,00002,113,536
2Jun 18, 2026 15:4862,66230,593,59623,185,00002,113,536
3Jun 18, 2026 15:4862,78630,846,69723,231,00002,113,536
4Jun 18, 2026 15:4862,80530,646,12023,238,00002,113,536
5Jun 18, 2026 15:4862,81830,841,08723,243,00002,113,536
6Jun 18, 2026 15:4863,40030,977,57523,458,00002,113,536
7Jun 18, 2026 15:4863,46731,008,40823,483,00002,113,536
8Jun 18, 2026 15:4863,91331,019,97323,648,00002,113,536
9Jun 18, 2026 15:4864,18131,137,45823,747,00002,113,536