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 7, 2026 02:20Victor MerckléVictor MerckléScore: 64,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 02:2163,72932,722,33422,529,0001,051,0002,113,536
2Jun 7, 2026 02:2163,80032,659,04022,536,0001,070,0002,113,536
3Jun 7, 2026 02:2163,96232,821,84222,522,0001,144,0002,113,536
4Jun 7, 2026 02:2164,03232,842,69722,567,0001,125,0002,113,536
5Jun 7, 2026 02:2164,13532,798,43322,587,0001,143,0002,113,536
6Jun 7, 2026 02:2164,15632,915,96222,589,0001,149,0002,113,536
7Jun 7, 2026 02:2164,29432,920,82022,718,0001,071,0002,113,536
8Jun 7, 2026 02:2164,52133,012,60222,726,0001,147,0002,113,536
9Jun 7, 2026 02:2164,52933,009,23122,721,0001,155,0002,113,536