Largest Square Submatrix of all 1's NoSIMD_C#

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 18:02Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 22:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:5908,759,8171,143,00002,117,632expected "51", got "50 "
2Jul 5, 2026 22:592,5628,865,0761,025,00002,117,632
3Jul 5, 2026 22:592,8708,776,7821,148,00002,117,632
4Jan 4, 2026 18:023,88822,343,96301,555,0002,453,504
5Jan 4, 2026 18:023,90821,224,8661,563,00002,445,312
6Jan 4, 2026 18:024,16517,296,1441,666,00002,449,408