Use a sorted generic list. If the number of elements is < 100 Add the incoming number to the list. else if the incoming number is greater than the zero element of the list Add the incoming number to the list remove the zero element from the list to keep the number of elements at 100.

Use a min heap to store the top 100 maximum numbers. If the incoming number is greater than the top element replace it and sort the heap.