Taxicab fast method

from collections import defaultdict

N =700
ntriples = 3 # for original Ramanujan problem set to 2

results = defaultdict(list)
for x in range(0, N):
    x3 = x ** 3
    for y in range(x, N):
        results[x3 + y ** 3].append((x, y))

for key in sorted(results.keys()):
    if len(results[key]) == ntriples:
        print key, results[key]