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 19, 2026 03:53olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:55C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:5709,416,7401,102,00002,117,632expected "300", got "104"
2Sep 5, 2026 10:5709,344,6521,118,00002,117,632expected "300", got "104"
3Sep 5, 2026 10:5709,323,2261,118,00002,117,632expected "300", got "104"
4Apr 19, 2026 03:533,38016,903,4081,352,00002,478,080
5Apr 19, 2026 03:534,33316,930,6171,733,00002,469,888
6Apr 19, 2026 03:534,35522,686,6031,742,00002,473,984