That is not a proof by the CS standard though -- well, unless the job is defined as "write a program that processes these N test inputs known in advance", in which case a program that prints the expected hardcoded output in response to each of the expected inputs and otherwise returns an error would be a good implementation :)

I personally avoid using a word "proof" to mean anything other than a mathematical proof. It can be done with code, for sure, but as grandparent said, usually isn't.

I think you may be assuming that the purpose of a CS degree is to teach people how to write programs that work, while it's really not :)

And there is such a thing as a correct implementation of an algorithm. Running it does not exactly prove things either, and it might not necessarily work on actual hardware, but it does show that the person understands at least part of the material.