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 listApr 15, 2026 10:51olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:59C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:5909,300,3611,106,00002,113,536expected "300", got "104"
2Sep 5, 2026 10:5909,303,0711,112,00002,113,536expected "300", got "104"
3Sep 5, 2026 10:5909,297,8771,106,00002,113,536expected "300", got "104"
4Apr 15, 2026 10:513,06519,819,7471,226,00002,478,080
5Apr 15, 2026 10:514,34816,806,1901,739,00002,478,080
6Apr 15, 2026 10:514,78814,811,9611,915,00002,535,424