Trie Sharding solutions

Trie Sharding was solved using Haskell by 10 contestants. Solution sizes: average 3052 bytes (shortest: 966; longest: 6826).

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