Try letting $x+y=u$ and $x-y=v$, so that $x=(u+v)/2$ and $y=(u-v)/2$. Modifying slightly the first part of Ron Gordon's answer, the equation $x^2-y^2-2xy-x+y=0$ can be rewritten as $2(x-y)^2-2(x-y)-(2y)^2=0$, which can be expressed as
$$2v^2-2v-(u-v)^2=0$$
or
$$v^2+2(u-1)v-u^2=0$$
for which one has
$$v=(1-u)\pm\sqrt{(u-1)^2+u^2}\qquad(*)$$
From here, you can plug in any value for $u$ greater than the stipulated $10^{12}$, solve for $v$, and then use the formulas $x=(u+v)/2$ and $y=(u-v)/2$ to get values for $x$ and $y$.
Ah, I see the OP has added the request that $x$ and $y$ be integers. This requires $u$ and $v$ to also be integers, of the same parity. It's easy to see that the parity condition is satisfied by any solution of $(*)$. Thus it's only necessary to find a large integer $u$ such that $(u-1)^2+u^2=k^2$ for some integer $k$. But this can be written as
$$U^2-2k^2=-1$$
where $U=2u-1$. This is a case of Pell's equation: take the "fundamental solution" $1+\sqrt2$, raise it to a sufficiently high (odd) power $(1+\sqrt2)^n$, expand that out with the binomial theorem, collect terms until you got something of the form $U+\sqrt2k$, and there you go.
A somewhat quicker way to get $a$ solution is to use a recursion based on repeated squarings:
$$(1,1)\to(3,2)\to(17,12)\to\ldots\to(U_n,k_n)\to(U_n^2+2k_n^2,2U_nk_n)\to\ldots$$
(followed by one more multiplication to get to an odd power).
Added later: With a little help from Wolfram Alpha, I get $x=756{,}872{,}327{,}473$ and $y=313{,}506{,}783{,}024$ as a solution with the smallest sum greater than $10^{12}$.