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 11, 2026 11:45Victor MerckléVictor MerckléScore: 63,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 11:4663,02930,731,57322,266,0001,055,0002,113,536
2Jun 11, 2026 11:4663,25631,024,01022,368,0001,037,0002,113,536
3Jun 11, 2026 11:4663,33530,837,53122,382,0001,052,0002,113,536
4Jun 11, 2026 11:4663,37030,870,83822,410,0001,037,0002,113,536
5Jun 11, 2026 11:4663,71630,971,06522,516,0001,059,0002,113,536
6Jun 11, 2026 11:4663,77231,576,59622,554,0001,042,0002,113,536
7Jun 11, 2026 11:4663,95631,060,71222,610,0001,054,0002,113,536
8Jun 11, 2026 11:4664,17831,705,40422,680,0001,066,0002,113,536
9Jun 11, 2026 11:4664,36431,709,52122,764,0001,051,0002,113,536