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:33Victor MerckléVictor MerckléScore: 71,072Success
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:3370,74035,347,53024,956,0001,218,0002,113,536
2Jun 24, 2026 22:3370,78935,283,92924,950,0001,242,0002,113,536
3Jun 24, 2026 22:3370,89135,397,28225,015,0001,215,0002,113,536
4Jun 24, 2026 22:3370,94335,415,87925,024,0001,225,0002,113,536
5Jun 24, 2026 22:3371,07235,425,10725,116,0001,181,0002,113,536
6Jun 24, 2026 22:3371,11635,454,14925,099,0001,214,0002,113,536
7Jun 24, 2026 22:3371,18935,392,95425,105,0001,235,0002,113,536
8Jun 24, 2026 22:3371,19435,435,71425,320,0001,022,0002,113,536
9Jun 24, 2026 22:33158,72167,757,06157,582,0001,145,0002,113,536