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 6, 2025 21:00zielajzielajError
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:0208,986,8701,064,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:0209,131,8821,047,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:0209,018,9231,035,00002,113,536expected "2", got "50 "
4Jun 6, 2025 21:003,25316,367,3491,301,00002,490,368
5Jun 6, 2025 21:003,28519,948,0211,314,00002,486,272
6Jun 6, 2025 21:003,34014,644,2631,336,00002,486,272