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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 23:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 23:2808,706,4581,123,00002,117,632expected "51", got "50 "
2Jul 5, 2026 23:282,5928,720,1621,037,00002,117,632
3Jul 5, 2026 23:282,8328,646,9571,133,00002,117,632
4Jan 4, 2026 06:004,05320,600,7791,621,00002,445,312
5Jan 4, 2026 06:004,09014,987,8301,636,00002,437,120
6Jan 4, 2026 06:004,39514,906,6041,758,00002,445,312