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 14:54vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:00C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:00025,364,50317,209,00002,113,536expected "10000", got "255 "
2Sep 7, 2026 15:00025,391,57817,211,00002,113,536expected "10000", got "255 "
3Sep 7, 2026 15:00025,457,66217,196,00002,113,536expected "10000", got "255 "
4May 27, 2025 14:5443,76333,957,56617,505,00002,490,368
5May 27, 2025 14:5443,89040,705,77017,556,00002,273,280
6May 27, 2025 14:5443,90838,760,14717,563,00002,273,280