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 listJun 4, 2025 21:28vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 18:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 18:29010,839,5581,127,00002,117,632expected "2", got "50 "
2Sep 4, 2026 18:29010,809,5191,143,00002,117,632expected "2", got "50 "
3Sep 4, 2026 18:29010,740,8461,128,00002,117,632expected "2", got "50 "
4Jun 4, 2025 21:283,70519,271,8451,482,00002,400,256
5Jun 4, 2025 21:283,77319,921,56001,509,0002,392,064
6Jun 4, 2025 21:283,85318,104,06301,541,0002,392,064