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 listNov 20, 2025 19:02izotoffizotoffScore: 1,701,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 19:021,699,585705,595,199676,835,0002,999,0002,326,528
2Nov 20, 2025 19:071,699,625706,783,389677,851,0001,999,0002,326,528
3Nov 20, 2025 19:071,700,388706,909,494679,155,0001,000,0002,326,528
4Nov 20, 2025 19:021,701,945710,872,883678,779,0001,999,0002,326,528
5Nov 20, 2025 19:071,702,058702,579,899679,824,000999,0002,326,528
6Nov 20, 2025 19:021,703,195710,346,227681,278,00002,416,640