Why do we should not to use simple count instead of cumulative count in Counting Sort?

I have this piece of code for counting sort and it is "counting" sort, because it actually counts occurrences. And it doesn’t use cumulative sum. I want to ask why it is bad to not to use cumulative sum in counting sort algorithm? (BTW it has O(n) runtime complexity)

def my_counting_sort(lst):
    counts = (max(lst)+1) * [0] # n
    output = []
    for item in lst: # n
        counts[item] += 1
    for index in range(len(counts)): # n
        item = counts[index]
        while item > 0:
            output.append(index)
            item -= 1
    return output