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 13:16vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:04Tomislav Tunkovic26.61CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:0409,364,146990,000016,384No answer to stdout. Died or killed?
2Jun 1, 2025 13:164,04520,286,2121,618,00002,486,272
3Jun 1, 2025 13:164,08815,860,8111,635,00002,486,272
4Jun 1, 2025 13:164,16818,577,5071,667,00002,490,368
5Jun 1, 2025 13:164,27023,408,9271,708,00002,482,176
6Jun 1, 2025 13:164,28015,308,0921,712,00002,531,328
7Jun 1, 2025 13:164,32015,560,2411,728,00002,490,368
8Jun 1, 2025 13:164,38819,378,0931,755,00002,490,368
9Jun 1, 2025 13:164,41815,600,0601,767,00002,531,328
10Jun 1, 2025 13:164,42019,015,2371,768,00002,486,272