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 27, 2025 17:29vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:09C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:09043,608,75335,135,00002,117,632expected "10000", got "255 "stderr
2Sep 7, 2026 15:09043,312,41135,055,00002,117,632expected "10000", got "255 "stderr
3Sep 7, 2026 15:09043,361,15635,074,00002,117,632expected "10000", got "255 "stderr
4May 27, 2025 17:2995,16366,177,12937,064,0001,001,0002,490,368
5May 27, 2025 17:2995,29562,287,65937,115,0001,003,0002,273,280
6May 27, 2025 17:2995,33359,979,07237,130,0001,003,0002,490,368