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 9, 2026 20:41Victor MerckléVictor MerckléScore: 66,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 20:4266,42733,563,57523,523,0001,055,0002,113,536
2Jun 9, 2026 20:4266,57533,669,28223,487,0001,146,0002,113,536
3Jun 9, 2026 20:4266,61833,702,42623,490,0001,159,0002,113,536
4Jun 9, 2026 20:4266,64833,723,93023,506,0001,154,0002,113,536
5Jun 9, 2026 20:4266,70233,701,71523,534,0001,146,0002,113,536
6Jun 9, 2026 20:4266,74533,753,77323,539,0001,157,0002,113,536
7Jun 9, 2026 20:4267,05433,832,22723,656,0001,154,0002,113,536
8Jun 9, 2026 20:4267,11033,839,96023,684,0001,147,0002,113,536
9Jun 9, 2026 20:4267,11033,874,63923,675,0001,156,0002,113,536