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 15:59Victor MerckléVictor MerckléScore: 57,581Success
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 16:0057,34530,235,49720,179,0001,039,0002,113,536
2Aug 28, 2026 16:0057,38130,234,58620,198,0001,033,0002,113,536
3Aug 28, 2026 16:0057,41830,251,30320,208,0001,037,0002,113,536
4Aug 28, 2026 16:0057,43229,390,88320,213,0001,037,0002,113,536
5Aug 28, 2026 16:0057,58130,391,70020,301,0001,004,0002,113,536
6Aug 28, 2026 16:0057,60829,695,65320,267,0001,048,0002,113,536
7Aug 28, 2026 16:0057,77029,750,71320,365,0001,010,0002,113,536
8Aug 28, 2026 16:0061,42138,852,35421,661,0001,065,0002,113,536
9Aug 28, 2026 16:0061,92752,209,10021,788,0001,125,0002,113,536