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 17:30vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:10C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:10044,667,75535,076,00002,117,632expected "10000", got "255 "stderr
2Sep 7, 2026 15:10043,574,12435,067,00002,117,632expected "10000", got "255 "stderr
3Sep 7, 2026 15:10043,496,51135,066,00002,117,632expected "10000", got "255 "stderr
4May 27, 2025 17:3095,20857,299,65337,081,0001,002,0002,273,280
5May 27, 2025 17:3095,42060,041,67537,164,0001,004,0002,482,176
6May 27, 2025 17:3095,57058,157,43537,222,0001,006,0002,531,328