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

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:0109,212,6471,013,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:0108,994,7201,061,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:0109,181,8471,010,00002,113,536expected "2", got "50 "
4Jun 5, 2025 01:413,24014,404,0021,296,00002,490,368
5Jun 5, 2025 01:413,27021,474,4151,308,00002,486,272
6Jun 5, 2025 01:413,29513,601,0821,318,00002,527,232