30th Anniversary Promotion: 30% OFF on all online purchased products from 24 May to 13 June (Max 1 seat per order & order must be placed by end user)
State-of-the-art binary code analysis tools

So far this is the absolute record for the binary size of one division/remainder/multiplication operation:


35 instructions, 87 bytes of code just to calculate a remainder of division by 2:

long long smod(long long x) { return x % 2; }

(compiled by gcc 3.4.4)
Anyone to come up with a longer single arithmeric operation?