Reordering Train Cars solutions

Reordering Train Cars was solved using Haskell by 12 contestants. Solution sizes: average 3292 bytes (shortest: 511; longest: 7669).

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

phi16 (S) (511 B)

gigikent (S) (661 B)

cMarine9 (S) (845 B)

cojna (S) (1138 B)

RaphaelJ (S) (1628 B)

jonnydee (S) (2334 B)

xnyhps (S) (2478 B)

DirkGently (S) (4613 B)

lemonidas (S) (4982 B)

lemonidas (L) (4982 B)

yairchu (S) (7669 B)

yairchu (L) (7669 B)