The complexity of this solution is O(n²) , where n is the length of the string.
Other solutions are only O(n)

Not an issue, read the error message properly.

Best solution I saw so far in regards to performance! I suspect that most of the speed benefit comparing other solution arrive from the i*i part which is very clever.

Honestly it's very clear as well, well done! :)

you got it the other way around, it tells you it expects the int 3022 to equal 10 , it should equal 10

While solving the Go version I calculate 10, it wants 3022.

Testing for:
numbers = [1369 1616 1 1 16 7 9 1 1 1]
Test Failed
Log

Expected
    <int>: 3022
to equal
    <int>: 10

How on Earth is it supposed to be 3022? Aren't there any more transformations possible?