Sorting X+Y (Pairwise Sums)

Given two sets of numbers, each of size $n$, how quickly can the set of all pairwise sums be sorted? In symbols, given two sets $X$ and $Y$, our goal is to sort the set

$$X+Y = \{x+y \mid x \in X, y \in Y\}.$$