compile visual studio c++ online

Language: Layout:

#include <iostream>
#include <vector>
#include <string>
#include <random>
#include <unordered_map>
#include <chrono>
#include <algorithm>
#include <functional>

using namespace std;

std::vector<std::string> generate_random_vec(std::size_t SIZE)
{
    const char alphanumeric[] = " 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";

std::default_random_engine rng;
    std::uniform_int_distribution<> dist (0, sizeof(alphanumeric) - 1);
    std::vector<string> result;
    result.resize(SIZE);
    
    std::random_device rd;
    std::mt19937 mt(rd());
    std::uniform_int_distribution<int>  dist_string_length(4, 32);
    
    for (std::size_t count = 0; count < SIZE; ++count)
    {
        std::string str;
        for (uint8_t i = 0; i < dist_string_length(mt); ++i)
        {
            str += alphanumeric[dist(rng)];
        }
        result[count] = std::move(str);
    }
        
    return result;
}

std::hash<std::string> hash_fn;
inline bool OrderString( const std::string& _left, const std::string& _right ){ return hash_fn(_left) < hash_fn(_right); }

int main() {
    std::string find_string = "Ogre 2.0";
    std::vector<std::string> vec_string = generate_random_vec(10000);
    std::unordered_map<std::string,int> stringToMap;
   
    vec_string.push_back(find_string);

for (auto itr : vec_string)
        stringToMap.emplace(itr, 1);

std::sort( vec_string.begin(), vec_string.end(), OrderString);

//for (auto itr : vec_string)
        //std::cout << itr << std::endl;
    //for (auto itr : stringToMap)
      //  std::cout << itr.first << std::endl;
    
    bool found_string = false;
    std::size_t RUN_COUNT = 100000;
    chrono::high_resolution_clock::duration elapsedTime_1;
    for (int count = 0; count < RUN_COUNT; ++count)
    {
        const auto startTime = chrono::high_resolution_clock::now();
        auto itr = std::lower_bound( vec_string.begin(), vec_string.end(), find_string, OrderString);
        if( itr != vec_string.end() && *itr == find_string )
        {
            int i = 0;
        }
      
        
        elapsedTime_1 += chrono::high_resolution_clock::now() - startTime;
    }
    std::cout << "sorted_vector Time: " << chrono::duration_cast<chrono::milliseconds>(elapsedTime_1).count() << " ms" << std::endl;

chrono::high_resolution_clock::duration elapsedTime_2;
    for (int count = 0; count < RUN_COUNT; ++count)
    {
        const auto startTime = chrono::high_resolution_clock::now();
        auto itr = stringToMap.find(find_string);
        if (itr != stringToMap.end() && itr->first != find_string)
        {
            int i = 0;
        }
        
        elapsedTime_2 += chrono::high_resolution_clock::now() - startTime;
    }
    std::cout << "unordered_map Time: " << chrono::duration_cast<chrono::milliseconds>(elapsedTime_2).count() << " ms" << std::endl;

return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.91 sec, absolute running time: 0.34 sec, absolute service time: 1.26 sec