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 listMar 12, 2026 03:57olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 23:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 23:2008,700,894923,00002,117,632expected "51", got "50"
2Jul 5, 2026 23:2008,543,719832,00002,117,632expected "51", got "50"
3Jul 5, 2026 23:2008,485,737842,00002,117,632expected "51", got "50"
4Mar 12, 2026 03:573,96018,340,7231,584,00002,531,328
5Mar 12, 2026 03:574,01318,501,5331,605,00002,502,656
6Mar 12, 2026 03:574,05820,926,7431,623,00002,490,368