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 listMay 21, 2026 19:16M-RochatM-RochatScore: 59,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:1758,75929,882,01521,741,00002,113,536
2May 21, 2026 19:1758,77232,502,66021,746,00002,113,536
3May 21, 2026 19:1758,78131,854,19820,748,0001,001,0002,113,536
4May 21, 2026 19:1758,85432,088,00420,754,0001,022,0002,113,536
5May 21, 2026 19:1759,02129,725,33920,750,0001,088,0002,113,536
6May 21, 2026 19:1759,04829,752,74520,815,0001,033,0002,113,536
7May 21, 2026 19:1759,11632,702,04720,869,0001,004,0002,113,536
8May 21, 2026 19:17115,88951,795,98241,855,0001,024,0002,113,536
9May 21, 2026 19:17116,53553,053,81142,097,0001,021,0002,113,536