8. 615 .
Let k=a+b=c+d.
Since 1⩽a⩽9,0⩽b、c、d⩽9, then
1⩽k⩽18.
When 1⩽k⩽9, in the above equation, a can take any value in {1,2, ⋯,k}, c can take any value in {0,1,⋯,k}, and once a、c are determined, b、d are also determined. Therefore, the number of four-digit numbers abcd that satisfy the condition is k(k+1).
When 10⩽k⩽18, a、b、c、d cannot be 0.
Let a1=10−a,b1=10−b,c1=10−c,d1=10−d.
Then 1⩽a1、b1、c1、d1⩽9.
Let k1=a1+b1=c1+d1. Then 2⩽k1⩽10, and
the four-digit number abcd corresponds one-to-one with the four-digit number a1b1c1d1.
In the above equation, a1 and c1 can take any value in {1,2,⋯,k1−1}, and once a1、c1 are determined, b1、d1 are also determined.
Therefore, the number of four-digit numbers a1b1c1d1 that satisfy k1=a1+b1=c1+d1 is (k1−1)2.
Thus, the total number of good numbers is
∑k=19k(k+1)+∑k1=210(k1−1)2=330+285=615.