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 24, 2026 15:16Victor MerckléVictor MerckléScore: 63,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 15:1763,23530,833,52323,397,00002,113,536
2Jun 24, 2026 15:1763,27231,043,48622,412,000999,0002,113,536
3Jun 24, 2026 15:1763,35430,997,99623,441,00002,113,536
4Jun 24, 2026 15:1763,42931,324,53823,469,00002,113,536
5Jun 24, 2026 15:1763,52131,644,07523,503,00002,113,536
6Jun 24, 2026 15:1763,71631,068,91723,575,00002,113,536
7Jun 24, 2026 15:1763,76431,053,64722,501,0001,092,0002,113,536
8Jun 24, 2026 15:1764,12931,544,93823,728,00002,113,536
9Jun 24, 2026 15:17624,605238,511,465231,104,00002,113,536