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 listMay 29, 2025 02:38zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 15:00C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:00016,227,2436,701,0001,008,0002,121,728expected "10000", got "255 "stderr
2Sep 7, 2026 15:00016,237,9726,695,0001,028,0002,121,728expected "10000", got "255 "stderr
3Sep 7, 2026 15:00016,237,3576,695,0001,013,0002,121,728expected "10000", got "255 "stderr
4May 29, 2025 02:3820,42524,576,9436,128,0002,042,0002,420,736
5May 29, 2025 02:3820,43532,334,9377,153,0001,021,0002,527,232
6May 29, 2025 02:3820,60323,271,0707,211,0001,030,0002,506,752