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 listNov 19, 2025 19:27Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 08:23C#_user10.00CustomSolution Broken
Sep 4, 2026 11:42Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 08:2409,520,2401,368,00002,117,632expected "10000", got "50 "
2Sep 7, 2026 08:2409,610,0741,370,00002,117,632expected "10000", got "50 "
3Sep 7, 2026 08:24010,296,2851,367,00002,117,632expected "10000", got "50 "
4Nov 19, 2025 19:444,53518,437,4741,814,00002,519,040
5Nov 19, 2025 19:444,73016,094,475946,000946,0002,478,080
6Nov 19, 2025 19:274,79016,247,620958,000958,0002,387,968
7Nov 19, 2025 19:274,80518,363,188961,000961,0002,383,872
8Nov 19, 2025 19:274,82519,917,723965,000965,0002,392,064
9Nov 19, 2025 19:444,95513,925,506991,000991,0002,387,968