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

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:2409,055,639945,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:2408,934,888949,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:2409,149,247946,00002,113,536expected "2", got "50 "
4Jun 4, 2025 01:053,51017,036,5281,404,00002,486,272
5Jun 4, 2025 01:053,59313,913,7121,437,00002,494,464
6Jun 4, 2025 01:053,71319,936,2321,485,00002,478,080