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 listApr 23, 2026 04:24Charles CabergsCharles CabergsScore: 71,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 04:2670,85444,755,81125,208,0001,008,0002,330,624
2Apr 23, 2026 04:2671,00238,668,76325,261,0001,010,0002,412,544
3Apr 23, 2026 04:2671,04841,500,74225,277,0001,011,0002,342,912
4Apr 23, 2026 04:2671,05644,716,77525,280,0001,011,0002,347,008
5Apr 23, 2026 04:2671,12745,260,23825,305,0001,012,0002,330,624
6Apr 23, 2026 04:2671,22144,793,28825,339,0001,013,0002,351,104
7Apr 23, 2026 04:2671,23542,997,71525,344,0001,013,0002,330,624
8Apr 23, 2026 04:2671,26744,939,87125,355,0001,014,0002,347,008
9Apr 23, 2026 04:2671,34048,355,68925,381,0001,015,0002,347,008