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 29, 2025 02:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:03C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:04016,607,8167,042,0001,027,0002,121,728expected "10000", got "255 "stderr
2Sep 7, 2026 15:04016,581,6007,035,0001,010,0002,121,728expected "10000", got "255 "stderr
3Sep 7, 2026 15:04016,566,3697,025,0001,015,0002,121,728expected "10000", got "255 "stderr
4May 29, 2025 02:0421,29523,514,1437,454,0001,064,0002,527,232
5May 29, 2025 02:0421,33524,746,3718,534,00002,527,232
6May 29, 2025 02:0421,59524,643,8168,638,00002,527,232