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 01:20Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 01:42Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 03:2908,977,388790,000024,576expected "2", got "50 "stderr
2Aug 18, 2026 01:231,2908,507,570516,000024,576stderr
3Aug 18, 2026 01:231,6758,812,280670,000024,576stderr
4Aug 18, 2026 01:231,7558,618,162702,000024,576stderr
5Aug 18, 2026 01:231,8508,621,596740,000024,576stderr
6Aug 18, 2026 01:231,86210,218,851745,000024,576stderr
7Aug 18, 2026 01:232,0128,966,766805,000024,576stderr
8Aug 18, 2026 01:232,0408,757,139816,000024,576stderr
9Aug 18, 2026 01:232,0508,809,309820,000024,576stderr
10Aug 18, 2026 01:232,0728,959,432829,000024,576stderr
11Sep 5, 2026 03:292,0858,872,777834,000024,576stderr
12Sep 5, 2026 03:292,6529,246,4411,061,000024,576stderr