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 30, 2026 22:14IlyaIlyaScore: 59,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:1758,95131,321,62520,701,0001,111,0002,113,536
2Jun 30, 2026 22:1759,09431,412,54920,679,0001,186,0002,113,536
3Jun 30, 2026 22:1759,10031,361,15820,676,0001,191,0002,113,536
4Jun 30, 2026 22:1759,19131,757,75420,698,0001,203,0002,113,536
5Jun 30, 2026 22:1759,36731,911,64120,777,0001,189,0002,113,536
6Jun 30, 2026 22:1759,43731,889,65720,774,0001,218,0002,113,536
7Jun 30, 2026 22:1759,44831,952,73820,776,0001,220,0002,113,536
8Jun 30, 2026 22:1759,48131,574,32020,780,0001,228,0002,113,536
9Jun 30, 2026 22:1759,51031,956,44620,792,0001,227,0002,113,536