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 4, 2025 23:45vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:0509,098,918969,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:0509,056,984888,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:0509,477,252985,00002,113,536expected "2", got "50 "
4Jun 4, 2025 23:452,85017,950,83201,140,0002,494,464
5Jun 4, 2025 23:453,37818,335,9671,351,00002,531,328
6Jun 4, 2025 23:453,40814,673,1801,363,00002,531,328