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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:47C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:47010,863,9871,347,00002,121,728expected "10000", got "32 "stderr
2Sep 7, 2026 14:4709,776,60801,471,0002,121,728expected "10000", got "32 "stderr
3Sep 7, 2026 14:4709,754,10001,479,0002,121,728expected "10000", got "32 "stderr
4May 31, 2025 02:504,19817,386,1321,679,00002,416,640
5May 31, 2025 02:504,95518,022,146991,000991,0002,416,640
6May 31, 2025 02:504,98820,883,29401,995,0002,428,928