This challenge is not code golf. Please read the scoring before you attempt to submit an answer.
You will be given a multi-line string as input. You should output the size of the largest contiguous chunk of non-space characters. Contiguous just means that the chunk is a single piece rather than multiple disconnected pieces.
Characters are adjacent to characters directly before and after then in the same row or column. So this means that chunks cannot be connected via diagonals only.
alskdm askl so mmsu 89s ks2mks 3klsl
These two chunks are disconnected the bigger one has 16 characters.
You must support all printable ASCII plus space and newline. If your program includes any characters outside of this range you must support those characters too. Nothing else needs to be supported. The input will contain at least 1 non-space character and may have trailing spaces on lines.
Answers will be scored first on the size of their own largest chunk with lower score being better. As a tie breaker they will be scored simply in their total length with lower score being better.
If you want to copy and paste them you can view the source here.
a => 1 a a => 1 a a => 2 5a $ a @ => 3 yus 8 2 3 => 4 323 ke => 3 alskdm askl so mmsu 89s ks2mks 3klsl => 16