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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:12C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:12010,657,4461,009,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:12010,709,6131,007,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:12010,665,3331,007,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 04:185,58824,421,14502,235,0002,404,352
5Jan 4, 2026 04:185,68317,360,95402,273,0002,392,064
6Jan 4, 2026 04:185,99324,571,4102,397,00002,404,352