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 15:32vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:04Tomislav Tunkovic17.30CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:0509,379,9161,129,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:0509,863,3071,873,00002,113,536expected "1140", got "128 "
3Sep 4, 2026 18:0509,424,2581,225,00002,113,536expected "211", got "128 "
4Jun 1, 2025 15:323,87522,937,4581,550,00002,486,272
5Jun 1, 2025 15:323,88520,186,3241,554,00002,490,368
6Jun 1, 2025 15:324,06314,893,9461,625,00002,486,272