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 29, 2025 00:53zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:07C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:08020,380,12412,021,00002,121,728expected "10000", got "9984 "stderr
2Sep 7, 2026 15:08020,482,11011,035,0001,014,0002,121,728expected "10000", got "9984 "stderr
3Sep 7, 2026 15:08020,375,43512,023,00002,121,728expected "10000", got "9984 "stderr
4May 29, 2025 00:5322,68324,534,6078,065,0001,008,0002,527,232
5May 29, 2025 00:5322,72523,988,6557,070,0002,020,0002,527,232
6May 29, 2025 00:5322,82526,823,1297,101,0002,029,0002,527,232