Olympiad Geometry · Superchallenge problem

A set of sticks has different whole-number lengths, each at most $100$, and no three of the sticks can be the sides of a (non-degenerate) triangle. What is the largest possible number of sticks in the set?