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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 22:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:5708,826,6761,040,00002,117,632expected "51", got "50 "
2Jul 5, 2026 22:5708,883,2781,038,00002,117,632expected "51", got "50 "
3Jul 5, 2026 22:5708,850,5411,140,00002,117,632expected "51", got "50 "
4Jan 4, 2026 18:213,78020,941,8051,512,00002,457,600
5Jan 4, 2026 18:183,83816,780,2101,535,00002,449,408
6Jan 4, 2026 18:183,89317,426,3961,557,00002,535,424
7Jan 4, 2026 18:213,90018,720,9291,560,00002,449,408
8Jan 4, 2026 18:183,93819,414,62401,575,0002,437,120
9Jan 4, 2026 18:214,13517,604,69501,654,0002,445,312