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 00:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:05Victor Mercklé34.76CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:0609,098,677970,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:0608,945,475972,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:0609,220,539963,00002,113,536expected "2", got "50 "
4Jun 4, 2025 00:593,31318,705,3651,325,00002,486,272
5Jun 4, 2025 00:593,38019,263,4611,352,00002,482,176
6Jun 4, 2025 00:593,67019,743,3661,468,00002,482,176