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 31, 2025 23:30zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:49C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4909,591,4491,301,00002,121,728expected "10000", got "50 "stderr
2Sep 7, 2026 14:49010,891,79501,409,0002,121,728expected "10000", got "50 "stderr
3Sep 7, 2026 14:4909,490,1911,307,00002,121,728expected "10000", got "50 "stderr
4May 31, 2025 23:304,30817,057,37601,723,0002,424,832
5May 31, 2025 23:305,03015,803,1101,006,0001,006,0002,428,928
6May 31, 2025 23:305,13016,700,59202,052,0002,412,544