Did someone already try to do this in dlang?
I guess it will be very hard to beat the java solutions running with graalvm!

https://news.ycombinator.com/item?id=38851337

Kind regards,
Christian

On Thursday, 11 January 2024 at 08:57:43 UTC, Christian Köstlin wrote:

I think C++ people already beated Java's performance https://github.com/buybackoff/1brc?tab=readme-ov-file#native

On Thursday, 11 January 2024 at 08:57:43 UTC, Christian Köstlin wrote:

The problem with this challenge can be seen in the initial comments. Writing the fastest possible program for a specific dataset is not the same thing as writing the fastest program for an arbitrary dataset of that size. And, indeed, the fastest program is the one that does nothing but print the answer.

Speed on this task doesn't tell you anything about performance with different types/sizes of data or constraints on programmer time needed to produce a correct implementation and maintain it over time.

On Thursday, 11 January 2024 at 11:21:39 UTC, Sergey wrote:

I feel we could beat c++ if they didn't radix sort

On Saturday, 13 January 2024 at 23:25:07 UTC, monkyyy wrote:

The project is very hard. Many optimizations and tricks were applied by others.
It requires a lot of skill to implement everything on a high level.