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 27, 2025 13:20vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:01C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:01026,437,15617,888,00002,113,536expected "10000", got "255 "
2Sep 7, 2026 15:01026,097,68717,899,00002,113,536expected "10000", got "255 "
3Sep 7, 2026 15:01026,399,38017,956,00002,113,536expected "10000", got "255 "
4May 27, 2025 13:2045,76541,951,59518,306,00002,531,328
5May 27, 2025 13:2045,79037,666,36118,316,00002,482,176
6May 27, 2025 13:2045,99840,015,43018,399,00002,273,280