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 12, 2026 09:38Victor MerckléVictor MerckléScore: 63,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 09:4562,83730,729,46223,250,00002,113,536
2Jun 12, 2026 09:4563,34330,956,93523,437,00002,113,536
3Jun 12, 2026 09:4563,64831,074,36823,550,00002,113,536
4Jun 12, 2026 09:4563,67531,360,54623,560,00002,113,536
5Jun 12, 2026 09:4563,72131,148,88923,577,00002,113,536
6Jun 12, 2026 09:4563,77231,136,81423,596,00002,113,536
7Jun 12, 2026 09:4563,79431,153,63323,604,00002,113,536
8Jun 12, 2026 09:4564,09131,236,50723,714,00002,113,536
9Jun 12, 2026 09:4564,19431,310,10523,752,00002,113,536