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 listJan 5, 2026 05:23Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:48C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:4908,930,167935,00002,117,632expected "300", got "100 "
2Sep 5, 2026 10:4909,049,676933,00002,117,632expected "300", got "100 "
3Sep 5, 2026 10:4909,050,338934,00002,117,632expected "300", got "100 "
4Jan 5, 2026 05:234,03818,180,0611,615,00002,445,312
5Jan 5, 2026 05:234,16521,273,6701,666,00002,441,216
6Jan 5, 2026 05:234,26017,542,7031,704,00002,535,424