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 20:57Victor MerckléVictor MerckléScore: 70,375Success
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 21:0070,15135,010,35424,703,0001,253,0002,113,536
2Jun 24, 2026 21:0070,22436,505,00924,963,0001,020,0002,113,536
3Jun 24, 2026 21:0070,29135,159,04824,736,0001,272,0002,113,536
4Jun 24, 2026 21:0070,36235,155,46224,761,0001,273,0002,113,536
5Jun 24, 2026 21:0070,37535,148,01924,750,0001,289,0002,113,536
6Jun 24, 2026 21:0070,39735,160,20024,778,0001,269,0002,113,536
7Jun 24, 2026 21:0070,60035,145,05724,848,0001,274,0002,113,536
8Jun 24, 2026 21:0070,61335,250,29225,106,0001,021,0002,113,536
9Jun 24, 2026 21:0070,67235,282,87625,127,0001,022,0002,113,536