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 listAug 28, 2026 15:24Victor MerckléVictor MerckléScore: 56,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:2556,68330,037,84219,942,0001,031,0002,113,536
2Aug 28, 2026 15:2556,73229,373,02419,962,0001,029,0002,113,536
3Aug 28, 2026 15:2556,73529,140,11719,952,0001,040,0002,113,536
4Aug 28, 2026 15:2556,80529,439,16019,986,0001,032,0002,113,536
5Aug 28, 2026 15:2556,80530,012,68820,015,0001,003,0002,113,536
6Aug 28, 2026 15:2556,85930,129,47120,028,0001,010,0002,113,536
7Aug 28, 2026 15:2556,86730,104,43320,010,0001,031,0002,113,536
8Aug 28, 2026 15:2556,92129,465,26420,036,0001,025,0002,113,536
9Aug 28, 2026 15:2556,94029,438,87120,066,0001,002,0002,113,536