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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:46C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4609,065,562703,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:46010,168,884801,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:4608,991,802798,00002,117,632expected "10000", got "100 "
4Jan 5, 2026 06:023,96815,210,3511,587,00002,269,184
5Jan 5, 2026 06:024,62318,017,88101,849,0002,441,216
6Jan 5, 2026 06:025,02520,770,1781,005,0001,005,0002,441,216