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 3, 2026 05:01Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:14C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1408,922,930897,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 15:1408,943,233919,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 15:1409,109,414870,00002,117,632expected "10000", got "100 "
4Jan 3, 2026 05:015,51517,570,49102,206,0002,445,312
5Jan 3, 2026 05:015,71018,133,10202,284,0002,441,216
6Jan 3, 2026 05:015,74521,488,08602,298,0002,449,408