[fpc-pascal] Happy tickets benchmark

[Mattias Gaertner]

On Sun, 14 Feb 2016 10:11:54 +0100
Florian Klaempfl <florian at freepascal.org> wrote:

>[...]
> For the record: with a few changes in the compiler I could reduce the
> execution time of the example significantly . But I won't commit it
> probably (maybe parts of it): extensive loop unrolling and loop
> invariant search has normally little advantages in real world programs
> and increases only compilation times.

If it is easy to implement could it be optional?

Mattias