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 listJun 1, 2025 17:19vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:55Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:5509,133,2541,090,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:5509,224,5071,085,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:5509,162,6251,091,00002,113,536expected "2", got "50 "
4Jun 1, 2025 17:192,86319,607,50201,145,0002,494,464
5Jun 1, 2025 17:193,64319,964,7201,457,00002,486,272
6Jun 1, 2025 17:193,77316,202,1931,509,00002,490,368
7Jun 1, 2025 17:193,90818,824,1231,563,00002,486,272
8Jun 1, 2025 17:193,95517,702,1201,582,00002,494,464
9Jun 1, 2025 17:194,03316,223,8141,613,00002,486,272