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 17, 2026 11:47M-RochatM-RochatScore: 60,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:5060,43231,163,78821,339,0001,021,0002,113,536
2May 17, 2026 11:5060,48933,096,68221,371,0001,010,0002,113,536
3May 17, 2026 11:5060,50233,274,45821,379,0001,007,0002,113,536
4May 17, 2026 11:5060,50533,948,33521,371,0001,016,0002,113,536
5May 17, 2026 11:5060,58131,579,63721,381,0001,034,0002,113,536
6May 17, 2026 11:5060,62731,241,78421,395,0001,037,0002,113,536
7May 17, 2026 11:5060,64532,337,07921,430,0001,009,0002,113,536
8May 17, 2026 11:5060,72431,808,23321,406,0001,062,0002,113,536
9May 17, 2026 11:5060,82931,362,61521,499,0001,008,0002,113,536