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 listMay 29, 2025 02:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:10C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:11023,392,31511,740,0003,177,0002,134,016expected "10000", got "255 "stderr
2Sep 7, 2026 15:11023,594,63611,949,0003,177,0002,134,016expected "10000", got "255 "stderr
3Sep 7, 2026 15:11023,314,38911,688,0003,161,0002,134,016expected "10000", got "255 "stderr
4May 29, 2025 02:0135,97341,805,82310,278,0004,111,0002,420,736
5May 29, 2025 02:0136,08041,200,20012,371,0002,061,0002,269,184
6May 29, 2025 02:0136,29534,791,60011,407,0003,111,0002,269,184