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 2, 2025 14:07vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:3509,365,5751,116,00002,113,536expected "2", got "50 "
2Sep 4, 2026 18:3509,204,6351,221,00002,113,536expected "2", got "50 "
3Sep 4, 2026 18:3509,257,5441,148,00002,113,536expected "2", got "50 "
4Jun 2, 2025 14:073,64815,839,2621,459,00002,494,464
5Jun 2, 2025 14:073,85822,909,0641,543,00002,486,272
6Jun 2, 2025 14:073,99021,480,1551,596,00002,486,272