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 22:28Victor MerckléVictor MerckléScore: 71,194Success
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 22:2870,79735,293,55324,987,0001,208,0002,113,536
2Jun 24, 2026 22:2870,88935,342,97425,016,0001,213,0002,113,536
3Jun 24, 2026 22:2870,90035,740,59025,008,0001,225,0002,113,536
4Jun 24, 2026 22:2870,95935,386,03625,046,0001,209,0002,113,536
5Jun 24, 2026 22:2871,19435,493,83525,104,0001,238,0002,113,536
6Jun 24, 2026 22:2871,22735,520,14525,129,0001,225,0002,113,536
7Jun 24, 2026 22:2871,25935,470,05825,345,0001,021,0002,113,536
8Jun 24, 2026 22:2871,27235,661,58325,134,0001,237,0002,113,536
9Jun 24, 2026 22:2871,32135,528,00825,365,0001,024,0002,113,536