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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:49C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:49010,599,398906,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:49010,533,333902,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:49010,587,908902,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 04:554,50522,254,59301,802,0002,396,160
5Jan 4, 2026 04:554,79821,687,2481,919,00002,408,448
6Jan 4, 2026 04:554,80018,004,60401,920,0002,510,848
7Jan 4, 2026 04:554,80319,080,08101,921,0002,387,968
8Jan 4, 2026 04:554,86019,202,6741,944,00002,510,848
9Jan 4, 2026 04:554,94518,935,943989,000989,0002,408,448