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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:05C#_user19.38CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:05010,982,83801,285,0002,121,728expected "10000", got "100 "
2Sep 7, 2026 15:05011,004,89401,280,0002,121,728expected "10000", got "100 "
3Sep 7, 2026 15:05011,030,29601,300,0002,121,728expected "10000", got "100 "
4Jan 4, 2026 04:575,47018,297,9441,094,0001,094,0002,355,200
5Jan 4, 2026 04:575,49517,226,15502,198,0002,359,296
6Jan 4, 2026 04:575,54018,545,8371,108,0001,108,0002,351,104