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 05:41Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:48C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4808,922,378693,00002,117,632expected "10000", got "100 "
2Sep 7, 2026 14:4808,994,388788,00002,117,632expected "10000", got "100 "
3Sep 7, 2026 14:4808,800,892798,00002,117,632expected "10000", got "100 "
4Jan 4, 2026 05:414,79014,748,562958,000958,0002,535,424
5Jan 4, 2026 05:414,79821,248,8561,919,00002,445,312
6Jan 4, 2026 05:414,80517,819,6111,922,00002,449,408