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 10, 2026 15:45Victor MerckléVictor MerckléScore: 67,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:4667,34332,466,66423,828,0001,089,0002,113,536
2Jun 10, 2026 15:4667,42432,473,48023,843,0001,104,0002,113,536
3Jun 10, 2026 15:4667,46732,465,06323,904,0001,059,0002,113,536
4Jun 10, 2026 15:4667,49432,460,03423,878,0001,095,0002,113,536
5Jun 10, 2026 15:4667,50832,545,27423,881,0001,097,0002,113,536
6Jun 10, 2026 15:4667,53532,485,79723,893,0001,095,0002,113,536
7Jun 10, 2026 15:4667,90032,683,65124,032,0001,091,0002,113,536
8Jun 10, 2026 15:4667,94832,645,84324,045,0001,096,0002,113,536
9Jun 10, 2026 15:4667,95932,680,27724,096,0001,049,0002,113,536