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

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:42Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 11:4309,913,35201,648,0002,121,728expected "1179", got "1216 "stderr
2Sep 4, 2026 11:4309,740,24301,629,0002,121,728expected "2", got "32 "stderr
3Sep 4, 2026 11:434,55510,043,92401,822,0002,121,728stderr
4May 31, 2025 00:504,87017,246,988974,000974,0002,428,928
5May 31, 2025 00:505,10017,874,34402,040,0002,428,928
6May 31, 2025 00:505,30817,645,98602,123,0002,420,736