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:31Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 22:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:5408,809,1891,114,00002,117,632expected "51", got "50 "
2Jul 5, 2026 22:5408,861,1561,200,00002,117,632expected "51", got "50 "
3Jul 5, 2026 22:542,8578,796,2701,143,00002,117,632
4Jan 5, 2026 02:313,75518,988,5511,502,00002,449,408
5Jan 5, 2026 02:313,86823,172,44501,547,0002,445,312
6Jan 5, 2026 02:314,07017,304,3051,628,00002,445,312