We consider contests with many, possibly heterogeneous, players and prizes, and show that the equilibrium outcomes of such contests are approximated by the outcomes of mechanisms that implement the assortative allocation in an environment with a single agent that has a continuum of possible types. This makes it possible to easily approximate the equilibria of contests whose exact equilibrium characterization is complicated, as well as the equilibria of contests for which there is no existing equilibrium characterization.