Merge sorted tick feeds

You receive $k$ exchange feeds, each a list of trade timestamps already sorted in increasing order. Merge them into one sorted list. With $N$ ticks in total, beat the $O(N \log N)$ cost of concatenating and sorting.