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 listAug 28, 2026 17:00Victor MerckléVictor MerckléScore: 64,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 17:0064,82732,123,52523,986,00002,113,536
2Aug 28, 2026 17:0064,85432,208,42322,960,0001,036,0002,113,536
3Aug 28, 2026 17:0064,86732,253,66722,970,0001,031,0002,113,536
4Aug 28, 2026 17:0064,89432,171,53823,004,0001,007,0002,113,536
5Aug 28, 2026 17:0064,90832,855,22422,995,0001,021,0002,113,536
6Aug 28, 2026 17:0064,98332,187,34023,041,0001,003,0002,113,536
7Aug 28, 2026 17:0065,12433,371,34823,085,0001,011,0002,113,536
8Aug 28, 2026 17:0065,14033,170,47423,067,0001,035,0002,113,536
9Aug 28, 2026 17:0065,15132,260,04623,097,0001,009,0002,113,536