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 listJun 3, 2025 23:55zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:48C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:4909,394,1881,098,00002,117,632expected "300", got "57 "
2Sep 5, 2026 10:4909,356,9341,030,00002,117,632expected "300", got "57 "
3Sep 5, 2026 10:4909,336,2731,087,00002,117,632expected "300", got "57 "
4Jun 3, 2025 23:554,04319,998,5621,617,00002,420,736
5Jun 3, 2025 23:554,09323,174,1821,637,00002,420,736
6Jun 3, 2025 23:554,13018,448,8121,652,00002,428,928