Use multiple rungs. In each rung OR as many as you can comfortably fit with an intermediate value Boolean as the output of the rung. Then OR all of the intermediate value Booleans.
What does BOR stand for? Bitwise OR?? If so, you could always use the bits in 3-4 DINT tags and examine each tag equal to 0 in series (or not equal to 0 in parallel, depending on what you're looking to do).
Can you pack the bit into a DINT array, perhaps using aliases? Then a simple FBC will tell you if any or none are set, which is basically what the BOR is telling you.
+1 to the Structured text idea, just create a custom instruction and us ST inside it.
Just add them all together if result > 0 then you know what you need.
Or BOR them in the ST, I'm not sure which is faster.