They are not talking about changing the theorem. The solution can arbitrarily chose to override or ignore certain things to make sure the theorem passes.
As in the infamous 2=1 (https://en.wikipedia.org/wiki/Mathematical_fallacy#Division_...). We ignore that division by zero is undefined, and boom, we get a "proper" solution to the stated theorem.
That's what the article means by "how do we know for sure that somewhere in the millions of lines of code there is no hack which changes the meaning of the statement, changes the rules from just the axioms of mathematics".
As for the meaning of the statement, I don't know how it is easy in maths. But in code, I've had Claude try and contort the definition of "function accepts integers" to "anything that can look as an integer e.g. a string containing an integer is accepted" and twist the solution to that.
If 'Challenge.lean' states the theorem, the solution can't change the theorem. The only thing it can do is do a 'sorry', just skip proving some part, but that's printed out very clearly when it happens.