The crossing number of a graph $G$ with $n$ vertices and $m\geq 4n$ edges is \begin{equation*} \crn(G)\geq \frac{1}{64}\frac{m^3}{n^2}. \end{equation*}