Largest Square Submatrix of all 1's C#_user

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
Back to listMay 30, 2025 17:32zielajzielajError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:55C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:55021,327,46011,806,0001,006,0002,121,728expected "10000", got "9984 "stderr
2Sep 7, 2026 14:55021,341,04111,805,0001,020,0002,121,728expected "10000", got "9984 "stderr
3Sep 7, 2026 14:55021,755,61412,187,0001,005,0002,121,728expected "10000", got "9984 "stderr
4May 30, 2025 17:3219,82023,461,1286,937,000991,0002,527,232
5May 30, 2025 17:3219,86028,906,7015,958,0001,986,0002,420,736
6May 30, 2025 17:3219,93524,162,6536,978,000996,0002,527,232