Prog Challenge

We all know the classic magic numbers, like 0xcafebabe and 0xdeadba11

But are there more? Write a routine which given an english dictionary finds all words re-presentable in hex that way.

Challenge: make it O(n)

>>8

Sorry, I don't know how to make it efficient without making it ugly.

Try Symta:
Ws.keep ?all^|'157abcdef'.has ?(l=1;s=5;t=7)

Most of it is self explanatory due to the incrediblly readable and intuitive nature of Symta syntax, except ?(l=1;s=5;t=7) which is just a regex-like pattern matcher, which works like that: https://imgur.com/a/v0u89V8

Symta was born out of desire to add Haskell-like syntax to Common Lisp, while keeping macros. In fact, Symta also has lexical macros, which are available separately:
https://nancygold.itch.io/new-c-macroprocessor