Challenge: Maximum Number of Prizes

Problem

---

Distinct Summands Problem

Represent a positive integer as the sum of the maximum number of pairwise distinct positive integers.

Input: An integer $n$.
Output: The maximum $k$ such that $n$ can be represented as the sum $a_{1}$ ...