Largest Square Submatrix of all 1's NoSIMD_C#

Find the largest square submatrix consisting entirely of 1s as fast as possible.

Input

A 10,000 x 10,000 matrix of uint8 values (0 or 1) on STDIN.

0, 1, 0, 1, 1
0, 1, 1, 1, 1
0, 0, 1, 0, 0
1, 0, 1, 1, 0

Output

Print the side length of the largest all-ones square submatrix to STDOUT. The answer is guaranteed to be greater than 1.

For the example above, the output is:

2

A generator is a program that produces test data and expected results for a challenge. Each time a solution is checked, the generator runs fresh - producing unique, unpredictable input.

Custom generators let you challenge other participants' solutions with your own test cases. If someone's solution fails on your generator's input, it exposes weaknesses in their approach. Writing good generators requires deep understanding of the problem - you need to craft edge cases, stress tests, and tricky inputs that push solutions to their limits.

Log in to create generators.