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 22, 2026 07:20olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:48C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:5009,429,4561,151,00002,117,632expected "300", got "100"
2Sep 5, 2026 10:5009,301,1291,081,00002,117,632expected "300", got "100"
3Sep 5, 2026 10:5009,240,3551,149,00002,117,632expected "300", got "100"
4Apr 22, 2026 07:214,15717,656,51601,663,0002,453,504
5Apr 22, 2026 07:214,29718,617,14301,719,0002,461,696
6Apr 22, 2026 07:215,05217,761,17102,021,0002,449,408