Hardness of perimeter minimization?

Question

Given $xy=C$ where $x, y$ are integer variables and $C$ is integer constant.

What is the most efficient algorithm that finds $x,y$ such that $x+y$ is minimum?

Providing references is highly appreciated.

Edit: Input integers are reasonably encoded.