aboutsummaryrefslogtreecommitdiff
path: root/src/main
Commit message (Collapse)AuthorAgeFilesLines
* Add davecom Entry David Kopec2024-01-051-0/+208
|
* fatroom's initial attempt Roman Romanchuk2024-01-051-0/+141
| | | | | | | | | | | | | * Initial attempt * Fixed temperature parsing * Switched to memory mapped files * Fixed rounding issues * Inline of temperature reading * Fixed output rounding
* feat: first version of the 1brc solutionanandmattikopp2024-01-051-0/+74
|
* armandino: first submissionArman Sharif2024-01-051-0/+241
|
* jgrateron: fix formattingAlexander Yastrebov2024-01-041-2/+2
| | | | Followup on #69
* Pass newly added tests :fingers-crossed:Nick Palmer2024-01-041-17/+33
|
* Attempt nicer threading via streams and spliteratorsNick Palmer2024-01-041-132/+102
|
* make aggregation state grow dynamicallyRichard Startin2024-01-041-18/+26
|
* add implementation jgrateronjairo2024-01-041-0/+166
|
* Adding Nils Semmelrock's submissionNils Semmelrock2024-01-041-0/+271
| | | nothing fancy, just work on chunks in parallel and optimize bottlenecks
* Updating Roy's submissionRoy van Rijn2024-01-041-68/+215
| | | | | | | | | | | | | | | | | * Added tests for endian-calculations (had these in a different class, perhaps handy for others to see as well) Inlined the hash function, runs locally in 2.4sec now, hopefully endian issues fix Added equals to support any city name up to 1024 in length, don't rely on hash * For clarity I've updated the code so endian doesn't change the hashes, easier to debug. * Fixing bug in array check Simple is faster * Also spotted the diff, not just the big exception Fixed buffer limit issue
* Adding Moysés Borges Furtado's submissionMoysés Borges Furtado2024-01-041-0/+201
|
* Adding a missing new lineGunnar Morling2024-01-041-1/+1
|
* Elliot Barlas: Use proper hash key collision detection schemeElliot Barlas2024-01-041-30/+67
| | | | | | | * Use open-addressing scheme to deal with hash table collisions. Reduce concurrency from 16 to 8. Use bit mask rather than mod operator to confine hash code to table range. * Properly handle file partitions that reside entirely within a line. * Reorder statements in doProcessBuffer.
* Updating Sam Pullara's entrySam Pullara2024-01-041-171/+151
|
* FormattingGunnar Morling2024-01-041-9/+14
|
* Adding artsiomkorzun's solutionartsiomkorzun2024-01-041-0/+354
|
* Manually compute temperature value instead of using Long.parseLongFilip Hrisafov2024-01-041-8/+14
|
* Use a hash key for the city as a key in the mapFilip Hrisafov2024-01-041-22/+40
|
* Use long parse and use char array instead of CharBuffer for adding to itFilip Hrisafov2024-01-041-13/+15
|
* Leaderboard updateGunnar Morling2024-01-042-16/+21
|
* Richard Startin: Adopt @spullara's double parsing code;Richard Startin2024-01-041-49/+28
| | | | * increase chunk size * simplify and tune parameters
* Adding Peter Lawrey's submissionPeter Lawrey2024-01-041-0/+215
|
* Auto reformat classesFilip Hrisafov2024-01-044-59/+66
|
* ddimtirov - switched to the foreign memory access preview API for another ↵Dimitar Dimitrov2024-01-031-59/+67
| | | | 10% speedup
* ddimtirov - lifted parallel mmapped i/o from Sam Pullara's implementationDimitar Dimitrov2024-01-031-175/+129
|
* ddimtirov - single-threaded datastructures tuning - reading to char buffers, ↵Dimitar Dimitrov2024-01-031-78/+193
| | | | one pass, no allocation processing
* ddimtirov - fixpoint, objects, streams and stringsDimitar Dimitrov2024-01-031-0/+131
|
* Roy van Rijn: memory mapped files, branchless parsing, bitwiddle magicRoy van Rijn2024-01-031-34/+278
| | | | | | Added SWAR (SIMD Within A Register) code to increase bytebuffer processing/throughput Delaying the creation of the String by comparing hash, segmenting like spullara, improved EOL finding Co-authored-by: Gunnar Morling <gunnar.morling@googlemail.com>
* richardstartin submissionRichard Startin2024-01-031-0/+413
|
* Adding filiphr's submission;Filip Hrisafov2024-01-031-0/+235
| | | | | | | | | | | * Initial implementation using Shenandoah GC and parallel iteration * Use memory mapped files * Iterate the buffer once and use BigDecimal parsing instead of Double.parseDouble * Add information about Graal * Add sdk use to calculate script
* Adding khmarbaiseKarl Heinz Marbaise2024-01-031-0/+61
|
* Adding seijikun's submissionMarkus Ebner2024-01-031-0/+221
|
* Adding Nick Palmer's submission;Nick Palmer2024-01-031-0/+250
| | | | | | | | | | | | | | | | | | | | | | | | | * Memory mapped file, single-pass parsing, custom hash map, fixed thread pool The threading was a hasty addition and needs work * Used arraylist instead of treemap to reduce a little overhead We only need it sorted for output, so only construct a treemap for output * Attempt to speed up double conversion * Cap core count for low-core systems * Fix wrong exponent * Accumulate measurement value in double, seems marginally faster Benchmark Mode Cnt Score Error Units DoubleParsingBenchmark.ourToDouble thrpt 10 569.771 ± 7.065 ops/us DoubleParsingBenchmark.ourToDoubleAccumulateInToDouble thrpt 10 648.026 ± 7.741 ops/us DoubleParsingBenchmark.ourToDoubleDivideInsteadOfMultiply thrpt 10 570.412 ± 9.329 ops/us DoubleParsingBenchmark.ourToDoubleNegative thrpt 10 512.618 ± 8.580 ops/us DoubleParsingBenchmark.ourToDoubleNegativeAccumulateInToDouble thrpt 10 565.043 ± 18.137 ops/us DoubleParsingBenchmark.ourToDoubleNegativeDivideInsteadOfMultiply thrpt 10 511.228 ± 13.967 ops/us DoubleParsingBenchmark.stringToDouble thrpt 10 52.310 ± 1.351 ops/us DoubleParsingBenchmark.stringToDoubleNegative thrpt 10 50.785 ± 1.252 ops/us
* Adding Elliot Barlas' submissionElliot Barlas2024-01-031-0/+209
|
* Using DoubleAccumulators to save on a measurment creation (#26)Roman Schweitzer2024-01-031-0/+205
|
* Adding Chris Riccomini's submissionChris Riccomini2024-01-031-0/+113
|
* Adding Sam Pullara's submission;Sam Pullara2024-01-033-2/+284
|
* Removed changes to formattingRene Schwietzke2024-01-031-2/+2
|
* Faster version of the data generatorRene Schwietzke2024-01-034-2/+1416
|
* Usage of try-with-resourcesKarl Heinz Marbaise2024-01-031-12/+7
| | | | pom file cleanup
* - implementation by padreatiAurelian Tutuianu2024-01-021-0/+197
|
* Evaluating bjhara's entryGunnar Morling2024-01-021-0/+15
|
* Implementation using memory mapped fileHampus Ram2024-01-021-0/+151
|
* Evaluating Kuduwa Keshavram's submissionGunnar Morling2024-01-021-1/+1
|
* Keshavram Kuduwa's SubmissionKeshavram Kuduwa2024-01-021-0/+79
|
* Evaluating itaske's submissionGunnar Morling2024-01-021-1/+1
|
* Adding itaske's implementationitaske2024-01-021-0/+76
|
* Initial implementation, using BufferedReader, parallel processing, combining ↵Roy van Rijn2024-01-012-8/+87
| | | | everything in a single go, sorting afterwards (unoptimized)
* README updateGunnar Morling2024-01-012-10/+58
|
generated by cgit v1.2.3 (git 2.25.1) at 2026-05-13 13:45:21 +0000