Java 7, 141 bytes + 10*67 = 811
==

    boolean
    b(char[]b){
    int
    o=0,p=0,i;
    for(char
    c:b){for(i=0;i<8;){if((c&(1<<i++))<1){o=0;p++;}else{p=0;o++;}if(3<o|3<p)return
    6<5;}}return
    5<6;}

I am using newlines instead of spaces to try to minimize penalty... It doesn't work too well, haha. This can almost certainly be improved but I haven't had time to really go through it more, yet.

[Try it online!](https://tio.run/nexus/java-openjdk#lY6xasMwEIZ3PYXIECRcTIKbECp5KIVunUKnkEFSlUbg6IQstwRVz@5e3I7t4OE4fu77jy8MunOGmk71PX1RzudRA3RWeaKZOat4OGqeifOJQLu6CzhOkBPE6UjMA15vybUr4eRO8OxOjJklW0vpqopzueYZmyJUlSi2623GHwJuCclGwlcjA482DdGTrdyIUn7DRm5FGcOPYJ9UwvUB7o1eUJPtU3T@/XBUaDeJU01b6u3nFBgXhO6vfbKXGoZUB4RT55muNVu8Nos6wRP6P8aoroxzpP@D73cz4GcAreKcgrXazin8gRZSxm8 "Java (OpenJDK 8) – TIO Nexus")

<h3>Binary</h3>

    011000100110111101101111011011000110010101100001011011100000101001100010001010000110001101101000011000010111001001011011010111010110001000101001011110110000101001101001011011100111010000001010011011110011110100110000001011000111000000111101001100000010110001101001001110110000101001100110011011110111001000101000011000110110100001100001011100100000101001100011001110100110001000101001011110110110011001101111011100100010100001101001001111010011000000111011011010010011110000111000001110110010100101111011011010010110011000101000001010000110001100100110001010000011000100111100001111000110100100101011001010110010100100101001001111000011000100101001011110110110111100111101001100000011101101110000001010110010101100111011011111010110010101101100011100110110010101111011011100000011110100110000001110110110111100101011001010110011101101111101011010010110011000101000001100110011110001101111011111000011001100111100011100000010100101110010011001010111010001110101011100100110111000001010001101100011110000110101001110110111110101111101011100100110010101110100011101010111001001101110000010100011010100111100001101100011101101111101