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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 22:34Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:3508,442,855926,00002,113,536expected "51", got "50 "
2Jul 5, 2026 22:3508,406,515926,00002,113,536expected "51", got "50 "
3Jul 5, 2026 22:3508,591,914929,00002,113,536expected "51", got "50 "
4Jun 4, 2025 21:563,02521,678,8671,210,00002,490,368
5Jun 4, 2025 21:563,24516,113,2051,298,00002,486,272
6Jun 4, 2025 21:563,28020,406,4541,312,00002,490,368