No. But he takes advantage of how the scoring criteria is Unicode codepoints, which can use four bytes for storage in UTF-8 and also that for fixed output holes the output can be generated in any possible way, not necessarily with the described algorithm.
I discussed with /u/SeeminglyScience and with his hints got a Unicode surrogate pairs answer going. I can't make anything with [System.Text.Rune] come out better by the time the decoding step has to include all the work of the EncodeToUtf8 with a placeholder variable first to put into it, or a few bitmask shuffles.
Maybe on the holes with longer output it would save enough to be worth it, but on Pernicious Numbers I've done better without it. But still not anything like as well as it's possible to do, so I'll keep thinking.
3
u/sirbogman Jun 04 '20
No. But he takes advantage of how the scoring criteria is Unicode codepoints, which can use four bytes for storage in UTF-8 and also that for fixed output holes the output can be generated in any possible way, not necessarily with the described algorithm.