The Champernowne constant is a transcendental decimal number whose digits are the concatination of all positive integers.
The binary version of this is
Write a program that prints C2 in decimal. The program should never halt. It should continue printing digits such that given infinite time and memory, it will print an infinite number of correct digits.
To illustrate this, you must account for integer overflow, since integer overflow will either cause an error or print incorrect digits, even with infinite memory available.
To test your code, here are the first 150 digits of this number.
Shortest code wins.