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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 23:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 23:0508,731,3741,151,00002,117,632expected "51", got "50 "
2Jul 5, 2026 23:052,8428,848,0371,137,00002,117,632
3Jul 5, 2026 23:052,8458,839,1721,138,00002,117,632
4Jan 4, 2026 06:023,94023,940,9891,576,00002,449,408
5Jan 4, 2026 06:023,95017,959,6321,580,00002,445,312
6Jan 4, 2026 06:024,04319,727,2391,617,00002,449,408