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 21:47Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 20:56Tomislav Tunkovic23.25CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 21:1109,531,324770,000024,576expected "2", got "50 "stderr
2Sep 4, 2026 21:1109,534,844769,000024,576expected "2", got "50 "stderr
3Aug 17, 2026 21:511,5159,661,476606,000024,576stderr
4Aug 17, 2026 21:511,5879,353,050635,000024,576stderr
5Aug 17, 2026 21:511,6128,726,635645,000024,576stderr
6Aug 17, 2026 21:511,6828,433,579673,000024,576stderr
7Aug 17, 2026 21:511,8709,461,717748,000024,576stderr
8Sep 4, 2026 21:111,95210,841,688781,000024,576stderr
9Aug 17, 2026 21:511,9579,560,693783,000024,576stderr
10Aug 17, 2026 21:512,0209,493,647808,000024,576stderr
11Aug 17, 2026 21:512,0308,885,307812,000024,576stderr
12Aug 17, 2026 21:512,24718,274,405899,000024,576stderr