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 16:11vahookvahookError
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,139,4547,725,00002,113,536expected "10000", got "255 "
2Sep 7, 2026 15:03015,809,0867,579,00002,113,536expected "10000", got "255 "
3Sep 7, 2026 15:03016,014,6097,557,00002,113,536expected "10000", got "255 "
4May 27, 2025 16:1146,84848,424,90018,739,00002,273,280
5May 27, 2025 16:1147,11544,774,93317,855,000991,0002,273,280
6May 27, 2025 16:1147,25346,161,73218,901,00002,273,280