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 25, 2026 00:40Victor MerckléVictor MerckléScore: 59,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 00:4059,54529,588,61522,032,00002,113,536
2Jun 25, 2026 00:4059,72729,582,50121,085,0001,014,0002,113,536
3Jun 25, 2026 00:4059,72729,559,65021,076,0001,023,0002,113,536
4Jun 25, 2026 00:4059,79130,285,36721,119,0001,004,0002,113,536
5Jun 25, 2026 00:4059,84829,600,08221,140,0001,004,0002,113,536
6Jun 25, 2026 00:4060,03229,894,88121,189,0001,023,0002,113,536
7Jun 25, 2026 00:4060,04029,664,59021,190,0001,025,0002,113,536
8Jun 25, 2026 00:4060,05430,101,87121,215,0001,005,0002,113,536
9Jun 25, 2026 00:4060,26429,760,82421,288,0001,010,0002,113,536