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 listMay 31, 2025 22:25zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 08:23C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 08:2409,588,6821,319,00002,121,728expected "10000", got "50 "stderr
2Sep 7, 2026 08:2409,614,3801,315,00002,121,728expected "10000", got "50 "stderr
3Sep 7, 2026 08:2409,648,8011,332,00002,121,728expected "10000", got "50 "stderr
4May 31, 2025 22:254,77318,202,38201,909,0002,428,928
5May 31, 2025 22:254,80022,341,028960,000960,0002,428,928
6May 31, 2025 22:254,89315,082,26901,957,0002,416,640