Largest Square Submatrix of all 1's C#_user

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 listAug 17, 2026 07:24marko1597marko1597Score: 6,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 07:284,6609,963,8991,864,00002,117,632stderr
2Aug 17, 2026 07:285,87011,568,9352,348,00002,117,632stderr
3Aug 17, 2026 07:285,98010,456,2372,392,00002,117,632stderr
4Aug 17, 2026 07:285,99210,558,7452,397,00002,117,632stderr
5Aug 17, 2026 07:286,77710,796,9572,711,00002,117,632stderr
6Aug 17, 2026 07:286,92210,868,5172,769,00002,117,632stderr
7Aug 17, 2026 07:287,04010,908,5182,816,00002,117,632stderr
8Aug 17, 2026 07:287,10511,002,4812,842,00002,117,632stderr
9Aug 17, 2026 07:287,18510,973,0662,874,00002,117,632stderr