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 listMay 29, 2025 11:58vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:51C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:52016,418,8158,118,00002,113,536expected "10000", got "128 "
2Sep 7, 2026 14:52016,394,9568,007,00002,113,536expected "10000", got "128 "
3Sep 7, 2026 14:52017,748,4098,094,00002,113,536expected "10000", got "128 "
4May 29, 2025 11:5821,06524,667,7758,426,00002,490,368
5May 29, 2025 11:5821,10028,544,2728,440,00002,486,272
6May 29, 2025 11:5821,15829,715,8708,463,00002,273,280