Designing a programming language to speedrun Advent of Code(blog.vero.site)

  :load wordlist wordlist.txt
  =hasABC { all (count _ x == 1) "abc" }
  words wordlist | filter -:(len == 10 and hasABC and .8 == "k")

    $ grep '^........k.$' /usr/share/dict/words | grep a | grep b | grep c | grep -v 'a.*a' | grep -v 'b.*b' | grep -v 'c.*c'
    backstroke
    bailiwicks
    benchmarks
    branchlike
    bushwhacks
    greenbacks
    matchbooks
    piggybacks
    roadblocks
    scrapbooks
    slingbacks
    throwbacks
    thumbtacks

  [me@fedora ~]$ time perl -n -e 'length($_) == 10 && /^[^a]*a[^a]*$/i && /^[^b]*b[^b]*$/i && /^[^c]*c[^c]*$/i && /k.$/i && print' /usr/share/dict/words | wc -l
  26

  real 0m0,168s
  user 0m0,162s
  sys 0m0,007s


  [me@fedora ~]$ time perl -n -e '/^(?=.{8}k.$)(?=[^a]*a[^a]*$)(?=[^b]*b[^b]*$)(?=[^c]*c[^c]*$)/ && print' /usr/share/dict/words | wc -l
  17

  real 0m0,260s
  user 0m0,254s
  sys 0m0,006s


  [me@fedora ~]$ time perl -n -e '/^.{8}k.$/ && /a/ && /b/ && /c/ && !/a.*a/ && !/b.*b/ && !/c.*c/ && print' /usr/share/dict/words | wc -l

  real 0m0,115s
  user 0m0,109s
  sys 0m0,008s


  [me@fedora ~]$ time bash -c "grep '^........k.\$' /usr/share/dict/words | grep a | grep b | grep c | grep -v 'a.*a' | grep -v 'b.*b' | grep -v 'c.*c'" | wc -l
  17

  real 0m0,015s
  user 0m0,010s
  sys 0m0,020s

  [me@fedora ~]$ time awk '/^.{8}k.$/ && /a/ && /b/ && /c/ && !/a.*a/ && !/b.*b/ && ! /c.\*c/ { print }' /usr/share/dict/words | wc -l
  17

  real 0m0,129s
  user 0m0,124s
  sys 0m0,006s

  [me@fedora ~]$ time perl -n -e 'local $_ = lc; length == 11  && substr($_,8,1) eq "k" && join("",sort [/([abc])/g]->@*) eq "abc" && print' /usr/share/dict/words | wc -l

  real 0m0,234s
  user 0m0,228s
  sys 0m0,007s

    ^(?=.{8}k.$)(?=[^a]*a[^a]*$)(?=[^b]*b[^b]*$)(?=[^c]*c[^c]*$)

    my @found = grep {
        local $_ = lc;
        length         == 10  &&
        substr($_,8,1) eq "k" &&
        join("",sort [/([abc])/g]->@*) eq "abc"
    } @words;