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 24, 2026 15:41Victor MerckléVictor MerckléScore: 63,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 15:4262,82730,737,25523,246,00002,113,536
2Jun 24, 2026 15:4262,98630,963,84223,305,00002,113,536
3Jun 24, 2026 15:4263,30831,311,32322,421,0001,003,0002,113,536
4Jun 24, 2026 15:4263,35430,912,77623,441,00002,113,536
5Jun 24, 2026 15:4263,45931,521,82523,480,00002,113,536
6Jun 24, 2026 15:4263,51331,590,37223,500,00002,113,536
7Jun 24, 2026 15:4263,58631,372,48022,526,0001,001,0002,113,536
8Jun 24, 2026 15:4263,79431,403,33923,604,00002,113,536
9Jun 24, 2026 15:42150,55163,749,37855,704,00002,113,536