I did: https://github.com/lukechampine/slouch
"Find all ten-letter words that contain each of the letters A, B, and C exactly once and that have the ninth letter K"
:load wordlist wordlist.txt
words wordlist | filter -:(len == 10 and .8 == "k")
A more interesting example: https://www.youtube.com/watch?v=i_zDbInYOpQAoC solutions here: https://github.com/lukechampine/advent/tree/master/2022
(The language has builtin commands for fetching inputs and submitting solutions)