Multi-base happiness solutions

Multi-base happiness was solved using Haskell by 13 contestants. Solution sizes: average 1748 bytes (shortest: 530; longest: 4649).

The list below is sorted by ranking. You can also sort by solution size.

320.

falsifian (S) (692 B)
692.

Matthew.Maurer (S) (1681 B)
711.

xyx (S) (657 B)
723.

jhpriestley (S) (1170 B)
769.

notogawa (S) (530 B)

805.

gglouser (S) (2505 B)
815.

Verum (S) (1070 B)
888.

yugr (S) (4064 B)
1155.

shujin (S) (4649 B)
1156.

sannysanoff (S) (743 B)

1436.

Yiding (S) (1667 B)
1608.

alexbagel (S) (2166 B)
1707.

joee (S) (1137 B)