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 5, 2025 01:37zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 17:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 17:5909,001,661923,00002,113,536expected "2", got "50 "
2Sep 4, 2026 17:5909,157,487928,00002,113,536expected "2", got "50 "
3Sep 4, 2026 17:5909,123,331872,00002,113,536expected "2", got "50 "
4Jun 5, 2025 01:373,15015,252,8441,260,00002,490,368
5Jun 5, 2025 01:373,25517,029,6651,302,00002,490,368
6Jun 5, 2025 01:373,30020,643,5631,320,00002,527,232