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 listMar 12, 2026 04:24olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:37C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:3709,590,530961,00002,117,632expected "300", got "112"
2Sep 5, 2026 10:3709,345,6581,022,00002,117,632expected "300", got "112"
3Sep 5, 2026 10:3709,232,7011,024,00002,117,632expected "300", got "112"
4Mar 12, 2026 04:243,49821,021,8211,399,00002,494,464
5Mar 12, 2026 04:244,16322,049,9511,665,00002,498,560
6Mar 12, 2026 04:244,44017,517,5051,776,00002,535,424