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

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:3009,371,0781,144,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:3009,187,6181,147,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:30010,248,7971,218,00002,113,536expected "2", got "50 "
4Jun 1, 2025 17:183,14015,454,7541,256,00002,490,368
5Jun 1, 2025 17:183,57816,700,4381,431,00002,490,368
6Jun 1, 2025 17:183,76314,885,8561,505,00002,482,176
7Jun 1, 2025 17:183,82019,737,7591,528,00002,490,368
8Jun 1, 2025 17:183,88022,256,5291,552,00002,490,368
9Jun 1, 2025 17:184,06823,459,5881,627,00002,486,272