A modern programming language that makes developers happier.

kotlinlang

Hi folks,
I saw on Kotlin website that operators for basic types don't produce any overhead.
Now I have an intention to write fixed point number type and math for it (because need absolute determinism and unlikely can afford strictfp modifier). Can anybody please advise how to achieve minimal overhead for that new "basic-for-me" type? I'm afraid anything will be on heap and math (I do a LOT of it) will be slow. Or it would be so hard that better just humbly accept strictfp with its performance?