title: Unsigned arithmetic and integer overflow
body: <p>I am trying to understand arithmetic overflow. Suppose I have the following,</p>
  
  <pre><code>unsigned long long x;
  unsigned int y, z;
  
  x = y*z;
  </code></pre>
  
  <p>y*z can lead to an integer overflow. Does casting one of the operands to an unsigned long long alleviate this issue. What is the expected result of the multiplication of a 64-bit operand with a 32-bit operand?</p>