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:11Victor MerckléVictor MerckléScore: 63,391Success
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:1262,41333,847,41623,093,00002,113,536
2Jun 10, 2026 15:1263,13534,021,83723,360,00002,113,536
3Jun 10, 2026 15:1263,22134,043,82223,392,00002,113,536
4Jun 10, 2026 15:1263,35134,268,92523,440,00002,113,536
5Jun 10, 2026 15:1263,39134,147,96323,455,00002,113,536
6Jun 10, 2026 15:1263,46734,187,42923,483,00002,113,536
7Jun 10, 2026 15:1263,47033,990,48423,484,00002,113,536
8Jun 10, 2026 15:1263,57234,165,85423,522,00002,113,536
9Jun 10, 2026 15:12151,50066,763,00256,055,00002,113,536