A subset $A$ of the integers is said to be sum-free if there do not exist elements $x,y,z \,{\in}\, A$ with $x \,{+}\, y \,{=}\, z$. It is shown that the number of sum-free subsets of $\{1,\ldots,N\}$ is $O(2^{N/2})$, confirming a well-known conjecture of Cameron and Erdős.