title: Time complexity of integer comparison in python
body: <p>What is the time complexity of integer comparison in Python for very large integers? For example, if we calculate factorial of 1000 using 2 functions, then check equality, is it O(1)?</p>
  
  <pre><code>def fact(n):
      prod = 1
      for i in range(n):
          prod = prod * (i + 1)
      return prod
  
  i = fact(1000)
  j = fact(1000)
  
  # Complexity of this check?
  if i == j:
      print "Equal"
  </code></pre>