lacker, there are infinite solutions to every problem, but if you want really to find a competitor to my algorithm that performs better you NEED to talk about a

lacker, there are infinite solutions to every problem, but if you want really to find a competitor to my algorithm that performs better you NEED to talk about algorithms not using more than O(1) for every new element processed. To sort the set from time to time is not valid under this assumptions for example. This is going to be M log M. Registers is O(M). p.s. M here is the number of top-elements tracked.