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 22, 2026 02:42Elijah KinElijah KinScore: 71,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 02:4371,13235,354,52925,299,0001,020,0002,113,536
2Jun 22, 2026 02:4371,16235,469,27425,288,0001,042,0002,113,536
3Jun 22, 2026 02:4371,17036,545,74425,172,0001,161,0002,113,536
4Jun 22, 2026 02:4371,23735,363,11825,229,0001,129,0002,113,536
5Jun 22, 2026 02:4371,34335,450,84425,361,0001,036,0002,113,536
6Jun 22, 2026 02:4371,38135,449,48825,285,0001,126,0002,113,536
7Jun 22, 2026 02:4371,53235,436,99525,441,0001,026,0002,113,536
8Jun 22, 2026 02:4371,59435,581,63925,380,0001,110,0002,113,536
9Jun 22, 2026 02:4372,16435,786,70125,602,0001,099,0002,113,536