Simulation performance of bitwise operators and binary arithmetic Operators
The key difference in a bit wise operator is that the number of bits has no effect on performance—each bit operation is independent of the other bits. But once you get to arithmetic operators then there is a dependency from LSB to MSB that creates a long timing arc.

Updated Answer to an almost entirely different question
What you are seeing is a difference in the level of coding abstraction. Simulators can add two 64 bit numbers on the host machine in one cycle. But if you wrote out the addition in terms of a sequence of Boolean equations, that would certainly take more simulation time.
If you wrote the parity equation as
p = ^data;

That would certainly take less simulation time.