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 6, 2025 23:23zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:03C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:03016,417,9277,964,00002,113,536expected "10000", got "50 "
2Sep 7, 2026 15:03016,529,4287,986,00002,113,536expected "10000", got "50 "
3Sep 7, 2026 15:03016,476,2957,966,00002,113,536expected "10000", got "50 "
4Jun 6, 2025 23:2321,17329,018,7898,469,00002,527,232
5Jun 6, 2025 23:2321,26029,413,6848,504,00002,265,088
6Jun 6, 2025 23:2321,62526,201,9588,650,00002,486,272