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 18:20Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:39C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:3909,301,7061,140,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:3909,281,8211,148,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:3909,183,9171,159,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 18:204,38318,708,0661,753,00002,449,408
5Jan 4, 2026 18:204,38815,235,9381,755,00002,449,408
6Jan 4, 2026 18:204,40820,147,4991,763,00002,449,408
7Jan 4, 2026 18:204,41019,025,1331,764,00002,445,312
8Jan 4, 2026 18:204,42519,629,6571,770,00002,453,504
9Jan 4, 2026 18:204,44816,723,21601,779,0002,453,504