gunnarmorling
commented
7 months ago Not sure why, but it's a bit slower (ran it multiple times, same result):
Benchmark 1: timeout -v 300 ./calculate_average_ianopolousfast.sh 2>&1
Time (mean ± σ): 5.563 s ± 0.141 s [User: 39.906 s, System: 0.755 s]
Range (min … max): 5.351 s … 5.692 s 5 runs
Summary
ianopolousfast: trimmed mean 5.59115306116, raw times 5.69155619016,5.35070126916,5.598124665159999,5.50029568816,5.67503883016
Leaderboard
| # | Result (m:s.ms) | Implementation | JDK | Submitter | Notes |
|---|-----------------|--------------------|-----|---------------|-----------|
| | 00:05.591 | [link](https://github.com/gunnarmorling/1brc/blob/main/src/main/java/dev/morling/onebrc/CalculateAverage_ianopolousfast.java)| 21.0.1-open | [Dr Ian Preston](https://github.com/ianopolousfast) | |
ianopolousfast
Simplify dedupe station to reduce branches. Use sub process trick to avoid mem unmap cost.
Check List:
[X] Tests pass (
./test.sh <username>shows no differences between expected and actual outputs)[X] All formatting changes by the build are committed
[X] Your launch script is named
calculate_average_<username>.sh(make sure to match casing of your GH user name) and is executable[X] Output matches that of
calculate_average_baseline.sh[X] For new entries, or after substantial changes: When implementing custom hash structures, please point to where you deal with hash collisions (line number)
Execution time: 13.8s
Execution time of reference implementation: 288s