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 5, 2026 02:34Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 23:00Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 23:0108,818,5851,113,00002,117,632expected "51", got "50 "
2Jul 5, 2026 23:0108,801,4731,142,00002,117,632expected "51", got "50 "
3Jul 5, 2026 23:01015,672,8571,090,00002,117,632expected "51", got "50 "
4Jan 5, 2026 02:343,77819,533,62301,511,0002,449,408
5Jan 5, 2026 02:343,91020,163,4521,564,00002,535,424
6Jan 5, 2026 02:344,24020,227,4271,696,00002,441,216