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 28, 2025 02:59vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:58C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:58019,725,34411,233,00002,113,536expected "10000", got "248 "
2Sep 7, 2026 14:58019,702,96811,228,00002,113,536expected "10000", got "248 "
3Sep 7, 2026 14:58019,751,79211,300,00002,113,536expected "10000", got "248 "
4May 28, 2025 02:5934,68830,324,54212,884,000991,0002,273,280
5May 28, 2025 02:5934,77535,061,57613,910,00002,486,272
6May 28, 2025 02:5934,79841,592,05913,919,00002,273,280