Alphametic (or cryptarithm or word/verbal addition)

  S E N D
+ M O R E
---------
M O N E Y
Each letter in the addition equation represents one of the digits zero through 9. Goal: determine the digit each letter represents, that makes the addition correct. A letter that is used more than once (such as M above) represents the same digit wherever it appears. Note: the leading letters (S and M above) cannot represent zero.

This program: computes a sorted list of the puzzle's letters ("d e m n o r s y" above), tests each permutation of 10 things (digits zero through 9) taken 8 (the number of unique letters in the puzzle above) at a time, puts the permutation's digits "into" the puzzle's equation to see if the addition is correct, outputs the answer found and the number of permutations tested (10! / 2! = 1814400). [For the equation to compute number of permutations, see link. For a discussion of solving this puzzle with a program, see link.]

Enter puzzle (without the operators):

    
Puzzles to copy and paste:
send more money   (i.e. send + more = money)
base ball games
usa ussr peace
i did too
to go out
hes the best
no no too late   (i.e. no + no + too = late)
father mother parent
zeroes ones binary
wrong wrong right
world trade center
terrible number thirteen
alphabet letters scrabble
apple lemon banana
apple grape plum banana
adam and eve moved
double double toil trouble
winter is windier summer is sunnier
earth air fire water nature
heart ears nose throat health
georgia vermont oregon virginia
we want no new atomic weapon
this isa great time waster
zero one two three
three three two two one eleven
five five nine eleven thirty
ten seven seven seven four four one forty
fourteen ten ten seven fortyone
nineteen thirteen three two two one one one fortytwo
forty ten ten sixty