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 18, 2026 03:22Victor MerckléVictor MerckléScore: 3,745Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 8, 2026 06:28C#_user10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 03:292,9929,033,5271,197,000077,824stderr
2Aug 18, 2026 03:293,0959,226,4151,238,000077,824stderr
3Aug 18, 2026 03:293,6779,558,6521,471,000077,824stderr
4Aug 18, 2026 03:293,7129,517,4131,485,000077,824stderr
5Aug 18, 2026 03:293,7459,485,5651,498,000077,824stderr
6Aug 18, 2026 03:293,7509,531,9691,500,000077,824stderr
7Aug 18, 2026 03:293,7859,770,7391,514,000077,824stderr
8Aug 18, 2026 03:293,8029,862,2891,521,000081,920stderr
9Aug 18, 2026 03:293,8479,553,1261,539,000081,920stderr