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 17, 2026 07:14marko1597marko1597Score: 9,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 07:182,6658,864,3521,066,00002,117,632stderr
2Aug 17, 2026 07:182,9229,082,0061,169,00002,117,632stderr
3Aug 17, 2026 07:188,90511,420,0693,562,00002,117,632stderr
4Aug 17, 2026 07:188,94511,612,3873,578,00002,117,632stderr
5Aug 17, 2026 07:189,26011,848,4603,704,00002,117,632stderr
6Aug 17, 2026 07:189,59711,748,7193,839,00002,117,632stderr
7Aug 17, 2026 07:189,94511,994,9023,978,00002,117,632stderr
8Aug 17, 2026 07:1810,02211,958,7774,009,00002,117,632stderr
9Aug 17, 2026 07:1810,03012,710,4054,012,00002,117,632stderr