How many distinct solutions are there? Suppose you put the numbers $1,2,\cdots ,10$ in each of the boxes below

such that every connected row and column sum to the same number. How many distinct solutions are there? (By distinct we mean disregarding cyclic permutations, reflections, etc.)
I tried this problem and found only one solution, namely $4,5, 1,10,8,2,3,6,9,7$ when read clockwise starting on the top leftmost square. I tried to prove it's unique but failed (miserably).
From experience, I know algebra isn't the best way to approach these types of problems, due to the number of variables and the symmetry of the equations. When trying to find $3\times3$ magic squares, for example, it'd be best to brute force all the possibilities rather than trying to solve a $9$-variable system.
So does anyone know how to solve this (preferably without guess-and-check)? Any help is welcomed and appreciated. 

There are ten solutions
\begin{align*}
  &1,4,5,9,7,3,2,6,8,10 \\
  &1,4,7,6,10,2,3,5,8,9 \\
  &1,5,6,7,9,3,2,4,10,8 \\
  &1,5,7,6,9,4,2,3,10,8 \\
  &2,3,6,9,7,4,1,5,10,8 \\
  &2,3,8,5,9,4,1,7,6,10 \\
  &3,1,10,5,8,6,2,4,7,9 \\
  &3,2,5,10,6,4,1,7,8,9 \\
  &6,1,5,10,4,8,2,3,9,7 \\
  &6,3,5,8,4,10,1,2,9,7
\end{align*}
which turn into $40$ distinct solutions when the numbers in the middles of the upper and/or lower rows are reversed. These are all the solutions, regarding rotations and reflections as the same.
