Largest Square Submatrix of all 1's NoSIMD_C#

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 listJun 6, 2025 20:39zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:58M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:30011,127,415624,000020,480expected "550", got "159 "
2May 17, 2026 15:3008,387,066621,000024,576expected "550", got "159 "
3May 17, 2026 15:3008,306,229616,000020,480expected "550", got "159 "
4Jun 6, 2025 20:392,84820,536,58101,139,0002,486,272
5Jun 6, 2025 20:393,04817,535,0551,219,00002,494,464
6Jun 6, 2025 20:393,18313,873,0421,273,00002,494,464