Sketch of a non-brute-force solution:
The sum of all four (a+b+c+d) is the square of the right-hand side of a Pythagorean triple in three different ways, so it has to be divisible by a handful of prime factors, each of which is 1 mod 4 (or else the prime 2). Since it cannot exceed sqrt(4*12000) < 220, there are not that many candidates. The right one turns out to be 130=2*5*13.

If you have any problems you think we might enjoy, please send them in. All replies should be sent to:ponder@il.ibm.com