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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:50C#_user24.50CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:50010,907,6791,090,00002,121,728expected "10000", got "100 "
2Sep 7, 2026 14:50010,806,9861,179,00002,121,728expected "10000", got "100 "
3Sep 7, 2026 14:50010,818,2421,063,00002,121,728expected "10000", got "100 "
4Jan 4, 2026 06:044,80519,534,914961,000961,0002,367,488
5Jan 4, 2026 06:054,82019,154,659964,000964,0002,371,584
6Jan 4, 2026 06:054,84022,122,729968,000968,0002,363,392
7Jan 4, 2026 06:054,84317,509,18701,937,0002,367,488
8Jan 4, 2026 06:045,10020,651,08502,040,0002,363,392
9Jan 4, 2026 06:045,18519,783,04802,074,0002,371,584