Theoretically, a larger word size makes the code a bit slower. The reason is that in a 64-bit architecture, pointers are 64-bit words, so data structures that are full of pointers (lists, trees, hash tables ...) tend to use more RAM than the equivalent 32-bit code bit architecture. Normal RAM is slow (it doesn’t respond as fast as the processor would like), so the processor embeds a small amount of RAM, called the cache, where the most frequently used data is stored. The cache size is limited (usually 32 KB on modern x86 from Intel). 64-bit pointers make it harder for the processor to store as many data elements as possible, resulting in reduced performance.
However...
, x86:
. . 3D- () - () . .
64- 4 . RAM- (, ) 4 64- , , , , . 32- .
x86 ( Mac) 64- 64- ; , . 64- SSE2, , x86.
, Mac, , 64- . 64- ; , 64- .
(, PowerPC), 32- 64- , 32-, ( 4 , RAM ) , 32- (, ).