We present a target implementation of a class of functional logic programming languages. We benchmark the functional component of our implementation on a small set of simple programs and compare its performance against the Glasgow Haskell Compiler. The results indicate that our approach is competitively efficient. We briefly outline the key characteristics of our implementation: underlying theory, data layout, memory management, execution, and optimizations.