Solve a specific character addition

solve.py

# Solve:
#    LETA
#   +TALL
#   =====
#   CACHE

for a in range(10):
  for e in range(10):
    for l in range(10):
      for t in range(10):
        for c in range(10):
          for h in range(10):
            if int(f"{l}{e}{t}{a}") + int(f"{t}{a}{l}{l}") == int(f"{c}{a}{c}{h}{e}"):
              print(f"{l}{e}{t}{a} + {t}{a}{l}{l} = {c}{a}{c}{h}{e}")
              

Removing solutions where the first character in some number is 0 we only have these solutions:

8921 + 2188 = 11109
6852 + 5266 = 12118
4783 + 8344 = 13127
8476 + 7688 = 16164

If we also remove solutions where several letters stand for the same digit, we only have one solution left:

4783 + 8344 = 13127