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 listMay 18, 2026 18:39M-RochatM-RochatScore: 59,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:4159,40232,397,56220,912,0001,067,0002,113,536
2May 18, 2026 18:4159,49431,448,99020,849,0001,164,0002,113,536
3May 18, 2026 18:4159,51031,209,55220,861,0001,158,0002,113,536
4May 18, 2026 18:4159,60836,618,83220,901,0001,154,0002,113,536
5May 18, 2026 18:4159,64531,873,83320,990,0001,079,0002,113,536
6May 18, 2026 18:4159,68133,326,30320,936,0001,146,0002,113,536
7May 18, 2026 18:4159,76431,351,28920,965,0001,148,0002,113,536
8May 18, 2026 18:4159,87033,647,60920,970,0001,182,0002,113,536
9May 18, 2026 18:4160,01333,147,44921,046,0001,159,0002,113,536