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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:56C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:5609,445,6811,022,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:5608,959,777903,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:5609,146,9711,013,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 04:165,37815,476,38002,151,0002,449,408
5Jan 4, 2026 04:165,39515,194,77802,158,0002,277,376
6Jan 4, 2026 04:165,45520,019,97502,182,0002,449,408