Unfortunately, the code is slow: you are checking for every possible number smaller than the smallest value of x and y. That is called "brute force programming" and although it will generate the correct value in time, it is not very efficient for large values of x and y (test cases involve numbers as large as 1.5 billion).

To solve this Kata, you have to find an algorithm that is much more efficient.