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 listAug 1, 2026 03:54Warren FuWarren FuError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 03:540338,595,241314,377,00014,083,0002,113,536expected "76", got "77"
2Aug 1, 2026 03:540338,595,647314,323,00014,043,0002,113,536expected "50", got "53"
3Aug 1, 2026 03:540339,597,294314,583,00014,067,0002,113,536expected "73", got "74"