Combining Karatsuba multiplication with a technique developed by Krandick for computing the high-order part of the quotient, we obtain an integer division algorithm which is only two times slower, on average, than Karatsuba multiplication. The main idea is to delay part of the dividend update until this can be done by multiplication between large balanced operands. An implementation under saclib is faster than classical multiplication at 40 words, and becomes two times faster at 250 words.