Data commit

Task/Anagrams/Frink/anagrams.frink

@@ -0,0 +1,16 @@
+d = new dict
+for w = lines["http://wiki.puzzlers.org/pub/wordlists/unixdict.txt"]
+{
+   sorted = sort[charList[w]]
+   d.addToList[sorted, w]
+}
+
+most = sort[toArray[d], {|a,b| length[b@1] <=> length[a@1]}]
+longest = length[most@0@1]
+
+i = 0
+while length[most@i@1] == longest
+{
+   println[most@i@1]
+   i = i + 1
+}