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 4, 2025 01:07zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:2608,993,455952,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:2609,173,6151,027,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:2609,276,604912,00002,113,536expected "2", got "50 "
4Jun 4, 2025 01:073,17317,485,32201,269,0002,494,464
5Jun 4, 2025 01:073,66313,312,4391,465,00002,486,272
6Jun 4, 2025 01:073,71324,060,6531,485,00002,486,272