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 00:38Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 10:41C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 10:4208,740,380519,000024,576expected "300", got "52 "stderr
2Sep 5, 2026 10:4209,102,084523,000024,576expected "300", got "52 "stderr
3Sep 5, 2026 10:4208,741,856531,000024,576expected "300", got "52 "stderr
4Aug 18, 2026 00:401,5758,757,478630,000024,576stderr
5Aug 18, 2026 00:401,58511,626,386634,000024,576stderr
6Aug 18, 2026 00:401,7778,834,950711,000024,576stderr
7Aug 18, 2026 00:401,8508,856,954740,000024,576stderr
8Aug 18, 2026 00:401,91710,194,916767,000024,576stderr
9Aug 18, 2026 00:401,9228,991,997769,000024,576stderr
10Aug 18, 2026 00:401,9958,923,586798,000024,576stderr
11Aug 18, 2026 00:402,0028,979,159801,000024,576stderr
12Aug 18, 2026 00:402,0409,086,768816,000024,576stderr