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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:02C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:02026,438,84618,248,00002,113,536expected "10000", got "248 "
2Sep 7, 2026 15:02026,446,32818,230,00002,113,536expected "10000", got "248 "
3Sep 7, 2026 15:02026,444,50418,253,00002,113,536expected "10000", got "248 "
4May 27, 2025 22:3746,54541,490,06418,618,00002,478,080
5May 27, 2025 22:3746,56041,615,41218,624,00002,273,280
6May 27, 2025 22:3746,84539,565,09918,738,00002,482,176