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 16:13Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:18C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:19010,905,42101,453,0002,142,208expected "10000", got "100 "
2Sep 7, 2026 15:1909,832,3321,341,00002,195,456expected "10000", got "100 "
3Sep 7, 2026 15:19011,649,39901,491,0002,158,592expected "10000", got "100 "
4Jan 1, 2026 16:137,77024,747,1672,072,0001,036,0002,351,104
5Jan 1, 2026 16:137,82323,233,0201,043,0002,086,0002,351,104
6Jan 1, 2026 16:138,07319,925,7461,076,0002,153,0002,383,872