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 08:01Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:09C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0909,185,952918,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:0909,091,534811,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:0909,177,287909,00002,117,632expected "10000", got "100 "
4Jan 1, 2026 08:015,50017,173,2901,100,0001,100,0002,441,216
5Jan 1, 2026 08:015,58020,945,6882,232,00002,445,312
6Jan 1, 2026 08:016,13322,118,2932,453,00002,449,408