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 1, 2026 17:07Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:22C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:2209,827,858940,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:2209,820,057941,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:2209,160,754896,00002,117,632expected "10000", got "100 "
4Jan 1, 2026 17:074,37525,254,9421,750,00002,445,312
5Jan 1, 2026 16:4310,87822,942,9164,351,00002,457,600
6Jan 1, 2026 16:4321,88023,344,7287,658,0001,094,0002,535,424
7Jan 1, 2026 17:0722,29024,111,8497,926,000990,0002,535,424
8Jan 1, 2026 17:0722,72525,261,2578,080,0001,010,0002,445,312
9Jan 1, 2026 16:4323,12026,571,0068,221,0001,027,0002,449,408