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 6, 2026 10:34Victor MerckléVictor MerckléScore: 64,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:3563,94032,811,84122,526,0001,132,0002,113,536
2Jun 6, 2026 10:3564,02132,756,67522,545,0001,143,0002,113,536
3Jun 6, 2026 10:3564,08132,834,98022,584,0001,126,0002,113,536
4Jun 6, 2026 10:3564,10235,269,84722,567,0001,151,0002,113,536
5Jun 6, 2026 10:3564,11632,833,50222,590,0001,133,0002,113,536
6Jun 6, 2026 10:3564,27232,933,34322,713,0001,068,0002,113,536
7Jun 6, 2026 10:3564,29732,945,28122,716,0001,074,0002,113,536
8Jun 6, 2026 10:3564,52932,986,82022,721,0001,155,0002,113,536
9Jun 6, 2026 10:3564,52933,033,84222,726,0001,150,0002,113,536