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:20Victor MerckléVictor MerckléScore: 71,089Success
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:2170,65635,316,01325,005,0001,138,0002,113,536
2Jun 24, 2026 22:2170,75635,297,35725,014,0001,166,0002,113,536
3Jun 24, 2026 22:2170,88135,354,20225,021,0001,205,0002,113,536
4Jun 24, 2026 22:2170,97235,398,36125,042,0001,218,0002,113,536
5Jun 24, 2026 22:2171,08935,410,23725,135,0001,168,0002,113,536
6Jun 24, 2026 22:2171,28335,902,58925,111,0001,264,0002,113,536
7Jun 24, 2026 22:21158,31368,973,86857,356,0001,220,0002,113,536
8Jun 24, 2026 22:21158,65968,233,55357,461,0001,243,0002,113,536
9Jun 24, 2026 22:21159,39468,077,48057,761,0001,215,0002,113,536