Both sorting and merging efficiently can be hard problems. Merging ordered sequences is a little bit easier, but still hard. Thankfully many hard problems in computer science have been well-studied. A good strategy for k-way merging is called Tournament Tree, or Loser Tree. Go didn’t have an implementation of that, so I made one. In this talk, we will look at: Fundamentals and problems of k-way merges Why Loser Tree is a good theoretical solution How Go generics enable an efficient implementation How profiling and benchmarks were used to tune the implementation and interface How to apply this in practice, exemplified through Prometheus, Pyroscope, and Grafana Loki Attendees of this talk will gain awareness of a new Open-Source package they could use and insight into the design of an interface using generics.