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 06:38Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:02C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 11:03021,609,46113,467,00002,117,632expected "300", got "100 "
2Sep 5, 2026 11:03021,653,02813,339,00002,117,632expected "300", got "100 "
3Sep 5, 2026 11:03021,500,69313,357,00002,117,632expected "300", got "100 "
4Jan 4, 2026 06:384,04523,517,2541,618,00002,445,312
5Jan 4, 2026 06:384,09016,221,3171,636,00002,449,408
6Jan 4, 2026 06:384,15015,771,31101,660,0002,449,408
7Jan 4, 2026 06:384,21518,938,5721,686,00002,449,408
8Jan 4, 2026 06:384,23014,847,6111,692,00002,449,408
9Jan 4, 2026 06:384,54817,893,4681,819,00002,531,328