Largest Square Submatrix of all 1's C#_user

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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:21C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:21010,300,246727,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:2109,037,781788,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:2108,991,743795,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 18:1815,07826,828,0245,026,0001,005,0002,449,408
5Jan 4, 2026 18:1815,10022,936,2405,034,0001,006,0002,449,408
6Jan 4, 2026 18:1815,33321,708,2845,111,0001,022,0002,449,408