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 31, 2025 21:34zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:46C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4609,724,7931,442,00002,121,728expected "10000", got "32 "stderr
2Sep 7, 2026 14:46018,117,6241,505,00002,121,728expected "10000", got "32 "stderr
3Sep 7, 2026 14:4609,737,9031,455,00002,121,728expected "10000", got "32 "stderr
4May 31, 2025 21:344,85521,372,257971,000971,0002,420,736
5May 31, 2025 21:344,93520,692,314987,000987,0002,420,736
6May 31, 2025 21:345,34015,325,0391,068,0001,068,0002,490,368