^.?$|^(..+?)\1+$
<answer>
Matches strings of any character repeated a non-prime number of times
I seem to remember he wrote something in Python that took hours to run, and his community got it down to milliseconds in C.
3 points
*
What took Matt’s code over an entire month to run, viewers optimized so damn hard that the majority of the runtime of the code is just loading the words, so they started optimizing the code to run while the word list was loading. Takes like 4 milliseconds to load the word list, and 2 milliseconds to run the program
People joke about the Parker Square, but he’s unironically the most inspiring public figure imo. The king of Doing The Damn Thing