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 6, 2025 20:56zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:07C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:07024,074,98615,484,00002,113,536expected "10000", got "50 "
2Sep 7, 2026 15:07023,909,77915,439,00002,113,536expected "10000", got "50 "
3Sep 7, 2026 15:07023,780,64515,416,00002,113,536expected "10000", got "50 "
4Jun 6, 2025 20:5610,28525,405,2413,086,0001,028,0002,490,368
5Jun 6, 2025 20:5622,58526,216,7148,031,0001,003,0002,273,280
6Jun 6, 2025 20:5640,45332,373,36315,170,0001,011,0002,527,232