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 06:21Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:36C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:37022,370,21314,167,00002,117,632expected "300", got "100 "
2Sep 5, 2026 10:37022,134,76414,129,00002,117,632expected "300", got "100 "
3Sep 5, 2026 10:37022,524,78114,335,00002,117,632expected "300", got "100 "
4Jan 4, 2026 06:213,95815,649,8891,583,00002,441,216
5Jan 4, 2026 06:214,13322,130,9391,653,00002,441,216
6Jan 4, 2026 06:214,21822,010,8741,687,00002,453,504