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 22:30Victor MerckléVictor MerckléScore: 2,002Success
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 22:411,3958,468,304558,000024,576stderr
2Aug 17, 2026 22:411,4478,713,973579,000024,576stderr
3Aug 17, 2026 22:411,64010,121,123656,000024,576stderr
4Aug 17, 2026 22:411,8178,650,592727,000024,576stderr
5Aug 17, 2026 22:412,0028,941,619801,000024,576stderr
6Aug 17, 2026 22:412,0128,875,113805,000024,576stderr
7Aug 17, 2026 22:412,0158,911,956806,000024,576stderr
8Aug 17, 2026 22:412,0178,786,990807,000024,576stderr
9Aug 17, 2026 22:412,01710,914,547807,000024,576stderr