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 1, 2025 15:31vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:58C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:59012,409,4604,117,000016,384No answer to stdout. Died or killed?
2Jun 1, 2025 15:193,94520,502,7631,578,00002,486,272
3Jun 1, 2025 15:194,03823,286,3341,615,00002,531,328
4Jun 1, 2025 15:314,05316,652,7071,621,00002,494,464
5Jun 1, 2025 15:314,10319,059,6831,641,00002,490,368
6Jun 1, 2025 15:314,20823,483,6741,683,00002,486,272
7Jun 1, 2025 15:194,27816,629,0431,711,00002,531,328
8Jun 1, 2025 15:314,30323,420,9221,721,00002,478,080
9Jun 1, 2025 15:314,39017,627,4021,756,00002,490,368
10Jun 1, 2025 15:314,39020,062,4451,756,00002,482,176