Largest Square Submatrix of all 1's NoSIMD_C#

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 listJan 5, 2026 02:32Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 22:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:4708,872,183986,00002,117,632expected "51", got "50 "
2Jul 5, 2026 22:4708,661,6021,062,00002,117,632expected "51", got "50 "
3Jul 5, 2026 22:472,6228,747,1841,049,00002,117,632
4Jan 5, 2026 02:323,77814,694,3601,511,00002,445,312
5Jan 5, 2026 02:323,83017,423,1631,532,00002,445,312
6Jan 5, 2026 02:323,84318,380,9171,537,00002,437,120