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 31, 2025 21:47zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:06C#_user15.92CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 11:07010,534,5252,110,00002,121,728expected "300", got "538 "stderr
2Sep 5, 2026 11:07010,397,7321,085,0001,030,0002,121,728expected "300", got "538 "stderr
3Sep 5, 2026 11:07010,393,2441,063,0001,034,0002,121,728expected "300", got "538 "stderr
4May 31, 2025 21:473,89822,002,4901,559,00002,424,832
5May 31, 2025 21:474,45522,510,1101,782,00002,420,736
6May 31, 2025 21:475,09021,288,83602,036,0002,428,928