A note on the Erdős conjecture about square packing

Let $f(n)$ denote the maximum total length of the sides of $n$ squares packed inside a unit square. Erdős conjectured that $f(k^2+1)=k$. We show that the conjecture is true if we assume that the sides of the squares are parallel to the sides of the unit square.