We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Then it'll be tough for OCaml players to solve this kind of problems with large input and huge amounts of computation as ocamlc just cannot produce fast enough byte codes to pass all the test cases. I've also test on a Morris-Pratt problem. It took about 1 second for the bytecode produced by ocamlc to work out the largest testcase, however, ocamlopt took just 0.054 second.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Range Minimum Query
You are viewing a single comment's thread. Return to all comments →
Then it'll be tough for OCaml players to solve this kind of problems with large input and huge amounts of computation as
ocamlc
just cannot produce fast enough byte codes to pass all the test cases. I've also test on a Morris-Pratt problem. It took about 1 second for the bytecode produced byocamlc
to work out the largest testcase, however,ocamlopt
took just 0.054 second.