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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 23:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 23:21010,516,59501,333,0002,117,632expected "51", got "50 "
2Jul 5, 2026 23:21010,414,3721,237,00002,117,632expected "51", got "50 "
3Jul 5, 2026 23:21010,447,8421,253,00002,117,632expected "51", got "50 "
4Jan 5, 2026 02:433,89522,457,7411,558,00002,396,160
5Jan 5, 2026 02:433,94317,312,67701,577,0002,400,256
6Jan 5, 2026 02:433,95318,829,84801,581,0002,396,160
7Jan 5, 2026 02:434,01517,897,48201,606,0002,396,160
8Jan 5, 2026 02:434,02023,571,5781,608,00002,400,256
9Jan 5, 2026 02:434,03321,724,5271,613,00002,408,448