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 4, 2026 05:38Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:44C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4409,146,593809,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:4409,080,517827,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:4409,114,280897,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 04:564,43320,555,9431,773,00002,445,312
5Jan 4, 2026 04:564,43516,888,5971,774,00002,445,312
6Jan 4, 2026 04:564,46021,645,7981,784,00002,449,408
7Jan 4, 2026 05:384,51317,202,2871,805,00002,449,408
8Jan 4, 2026 05:384,83521,452,561967,000967,0002,449,408
9Jan 4, 2026 05:384,83520,063,723967,000967,0002,445,312