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 listSep 4, 2026 09:35Victor MerckléVictor MerckléScore: 1,965Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 11:09C#_user10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:361,2528,543,501501,000020,480stderr
2Sep 4, 2026 09:361,3908,669,518556,000020,480stderr
3Sep 4, 2026 09:361,7958,863,060718,000020,480stderr
4Sep 4, 2026 09:361,9258,874,707770,000020,480stderr
5Sep 4, 2026 09:361,9658,946,547786,000020,480stderr
6Sep 4, 2026 09:361,9729,600,888789,000020,480stderr
7Sep 4, 2026 09:361,9958,971,794798,000020,480stderr
8Sep 4, 2026 09:362,0059,618,882802,000020,480stderr
9Sep 4, 2026 09:362,2279,683,184891,000020,480stderr