@@ -0,0 +1,790 @@
+import java.util.HashSet;%0Aimport java.util.Set;%0A%0A@SuppressWarnings(%22unused%22)%0Apublic class P125 implements Puzzle %7B%0A%0A    final int limit = 100_000_000;%0A%0A    public String solve() %7B%0A%0A        final int limit = 100_000_000;%0A%0A        long sum = 0;%0A        final Set%3CInteger%3E results = new HashSet%3C%3E();%0A%0A        for (int i = 1; i * i %3C limit; i++) %7B%0A            int candidate = i * i;%0A            for (int j = i + 1; ; j++) %7B%0A                candidate += j * j;%0A                if (candidate %3E limit) %7B%0A                    break;%0A                %7D%0A                if (candidate == Util.reverse(candidate) && !results.contains(candidate)) %7B%0A                    sum += candidate;%0A                    results.add(candidate);%0A                %7D%0A            %7D%0A        %7D%0A        return %22%22 + sum;%0A    %7D%0A%7D

add 125