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

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 14:39C#_user22.10CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:39051,550,75941,506,000016,384No answer to stdout. Died or killed?
2Jun 1, 2025 13:0812,46520,897,1161,994,0002,992,0002,285,568
3Jun 1, 2025 13:0812,51322,493,6434,004,0001,001,0002,396,160
4Jun 1, 2025 13:0812,65324,980,8053,037,0002,024,0002,396,160
5Jun 1, 2025 13:0812,67523,975,4794,056,0001,014,0002,281,472
6Jun 1, 2025 13:0812,79524,631,8733,071,0002,047,0002,396,160
7Jun 1, 2025 13:0812,81523,986,5514,101,0001,025,0002,396,160
8Jun 1, 2025 13:0812,90320,461,8053,097,0002,064,0002,396,160
9Jun 1, 2025 13:0812,93821,778,6533,105,0002,070,0002,387,968
10Jun 1, 2025 13:0813,22824,593,0244,233,0001,058,0002,383,872