I wrote it using C++11. Currently I'm using an insertion sort for handling median, so the runtime is O(n^2). The word counter uses std::setstd::string and std::map<std::string, std::uint64_t> so the runtime is O(n log(n)).