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 22:58vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:46C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:47017,155,6456,250,0001,028,0002,121,728expected "10000", got " "stderr
2Sep 7, 2026 14:47017,168,8126,275,0001,048,0002,121,728expected "10000", got " "stderr
3Sep 7, 2026 14:47017,300,6666,286,0001,059,0002,121,728expected "10000", got " "stderr
4May 31, 2025 22:5819,74329,976,1705,923,0001,974,0002,396,160
5May 31, 2025 22:5819,74324,629,3896,910,000987,0002,400,256
6May 31, 2025 22:5819,76025,243,2946,916,000988,0002,277,376