Perform a simple word count on a text file. To isolate I/O from other aspects, all solutions should implement the following stages:

• IO: Read entire file into memory (one large string).
• Split: Split string on split characters: '\n' and ' ' (single space)
• Count: Iterate over words to build a hash map with counts.

Benchmark aspects: Hash maps, basic string operations, allocation

Input

• Path of text file to read.

Control Output

After writing the stage run times to STDOUT, the implementations should print:

• Size of the word map
• Sum of the counts in the map

• C++: Default implementation for C++, gcc (O3)
• C++: Default implementation for C++, clang (O3)
• Nim: Default implementation for Nim (gcc)
• Nim: Default implementation for Nim (clang)
• Python: Default implementation for Python
• Scala: Default implementation for Scala

Each bar corresponds to the run time of one particular stage. Use mouse-over to highlight a single stage for comparison. Only shows run times of the largest data size.

Run time: Total

All raw run times of individual runs for small (file size = ~1.0 MB), medium (file size = ~10.0 MB), and large (file size = ~100.0 MB) problem sizes. Use mouse-over to see relative performance.

Run time: IO

All raw run times of individual runs for small (file size = ~1.0 MB), medium (file size = ~10.0 MB), and large (file size = ~100.0 MB) problem sizes. Use mouse-over to see relative performance.

Run time: Split

All raw run times of individual runs for small (file size = ~1.0 MB), medium (file size = ~10.0 MB), and large (file size = ~100.0 MB) problem sizes. Use mouse-over to see relative performance.

Run time: Count

All raw run times of individual runs for small (file size = ~1.0 MB), medium (file size = ~10.0 MB), and large (file size = ~100.0 MB) problem sizes. Use mouse-over to see relative performance.