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 1, 2026 15:55Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:22C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:2205,445,158,2135,435,257,0001,175,0002,117,632expected "10000", got "199 "
2Sep 7, 2026 15:2205,445,183,9265,435,501,0001,011,0002,117,632expected "10000", got "199 "
3Sep 7, 2026 15:2205,445,602,4225,435,704,0001,005,0002,117,632expected "10000", got "199 "
4Jan 1, 2026 15:5521,65023,018,3988,660,00002,531,328
5Jan 1, 2026 15:5525,57529,808,7939,207,0001,023,0002,441,216
6Jan 1, 2026 15:5526,12827,832,8658,361,0002,090,0002,281,472