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 11:15vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:53C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:53016,474,4868,220,00002,113,536expected "10000", got "127 "
2Sep 7, 2026 14:53016,649,3248,275,00002,113,536expected "10000", got "127 "
3Sep 7, 2026 14:53016,537,3068,213,00002,113,536expected "10000", got "127 "
4May 29, 2025 11:1521,61526,102,1368,646,00002,273,280
5May 29, 2025 11:1521,69824,716,0888,679,00002,482,176
6May 29, 2025 11:1521,71522,798,1908,686,00002,273,280