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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:42C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4209,652,0121,289,00002,121,728expected "10000", got "50 "stderr
2Sep 7, 2026 14:4209,658,8601,298,00002,121,728expected "10000", got "50 "stderr
3Sep 7, 2026 14:4209,693,1591,357,00002,121,728expected "10000", got "50 "stderr
4May 31, 2025 23:354,81815,172,21801,927,0002,420,736
5May 31, 2025 23:354,89019,304,621978,000978,0002,428,928
6May 31, 2025 23:354,96020,238,836992,000992,0002,420,736