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 4, 2025 21:18vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:36C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:37010,707,7021,062,00002,121,728expected "300", got "51 "stderr
2Sep 5, 2026 10:37010,673,6541,052,00002,121,728expected "300", got "51 "stderr
3Sep 5, 2026 10:37010,794,1791,148,00002,121,728expected "300", got "51 "stderr
4Jun 4, 2025 21:184,04521,581,17401,618,0002,392,064
5Jun 4, 2025 21:184,07019,833,13601,628,0002,387,968
6Jun 4, 2025 21:184,09320,827,5561,637,00002,392,064