You are here: Home > Fastcode project > MinInt Challenge
![]() |
MinInt Challenge
The objective is to build the fastest replacement for RTL MinInt.
Validation and Benchmark Tool:
Tables of results
| Target | Function | Author | Speed up over RTL |
| P4 Northwood | MinLBGAsm | Lars Bloch Gravengaard | 1,44 |
| P4 Prescott | MinShaIntegerPas | Aleksandr Sharahov | 1,67 |
| Pentium M | MinLBGAsm | Lars Bloch Gravengaard | 1,39 |
| P3 | MinLBGAsm | Lars Bloch Gravengaard | 1,68 |
| Athlon XP | MinLBGAsm | Lars Bloch Gravengaard | 1,94 |
| Opteron | MinLBGAsm | Lars Bloch Gravengaard | 2,10 |
| RTL Suggestion | MinShaIntegerPas | Aleksandr Sharahov | 1,56 |
| Pascal | MinShaIntegerPas | Aleksandr Sharahov | 1,18 |
| Blended | MinLBGAsm | Lars Bloch Gravengaard | 1,64 |
