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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:34C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:3509,012,603793,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:3508,816,407801,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:3508,889,387719,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 05:524,25019,827,0781,700,00002,449,408
5Jan 4, 2026 05:544,29020,239,6241,716,00002,433,024
6Jan 4, 2026 05:544,31821,060,1841,727,00002,449,408
7Jan 4, 2026 05:524,36822,349,11301,747,0002,449,408
8Jan 4, 2026 05:544,38018,525,7171,752,00002,445,312
9Jan 4, 2026 05:524,79820,406,71701,919,0002,535,424