Given a list of posts, compute the top 5 related posts for each post based on the number of shared tags.
- Read the posts JSON file.
- Iterate over the posts and populate a map containing:
tag -> List<int>
, with the int representing the post index of each post with that tag.
- Iterate over the posts and for each post:
- Create a map:
PostIndex -> int
to track the number of shared tags
- For each tag, Iterate over the posts that have that tag
- For each post, increment the shared tag count in the map.
- Sort the related posts by the number of shared tags.
- Write the top 5 related posts for each post to a new JSON file.
./run.sh go | rust | python | all
Rules
- FFI (including assembly inlining)
- Unsafe code blocks
- Custom benchmarking
- Disabling runtime checks (bounds etc)
- Parse json at runtime
- Not hardcore number of posts
- Support up to 100 tags
- Use a stable release of the compiler/runtime
Updated Results from github workflow (raw data)
Language |
Processing Time |
Total (PT + I/O) |
Zig |
29.00 ms |
71.4 ms |
Rust |
29.30 ms |
46.5 ms |
Go |
29.36 ms |
60.9 ms |
Java (GraalVM) |
36.00 ms |
64.2 ms |
Odin |
45.85 ms |
329.3 ms |
Nim |
47.08 ms |
75.5 ms |
Vlang |
47.29 ms |
350.4 ms |
Fsharp |
50.29 ms |
830.5 ms |
Swift |
50.41 ms |
417.8 ms |
Crystal |
58.44 ms |
108.8 ms |
Dart VM |
79.88 ms |
552.8 ms |
LuaJIT |
107.23 ms |
403.7 ms |
Dart AOT |
116.75 ms |
248.8 ms |
JS (Deno) |
150.80 ms |
240.0 ms |
JS (Node) |
166.80 ms |
240.8 ms |
Java (JIT) |
239.38 ms |
523.6 ms |
Numpy |
0.41 s |
632.3 ms |
Julia v2 |
588.33 ms |
4.924 s |
JS (Bun) |
614.60 ms |
684.5 ms |
Lua |
1952.36 ms |
2.601 s |
Python |
2.59 s |
2.664 s |
Language |
Processing Time |
Total (PT + I/O) |
Rust Concurrent |
15.34 ms |
33.1 ms |
Go Concurrent |
16.89 ms |
50.4 ms |
Swift Concurrent |
32.71 ms |
409.5 ms |
Fsharp Concurrent |
41.29 ms |
830.9 ms |
Old Results with details (on my machine)
Language |
Processing Time |
Total (+ I/O) |
Details |
Rust |
- |
4.5s |
Initial |
Rust v2 |
- |
2.60s |
Replace std HashMap with fxHashMap by phazer99 |
Rust v3 |
- |
1.28s |
Preallocate and reuse map and unstable sort by vdrmn and Darksonn |
Rust v4 |
- |
0.13s |
Use Post index as key instead of Pointer and Binary Heap by RB5009 |
Rust v5 |
38ms |
52ms |
Rm hashing from loop and use vec[count] instead of map[index]count by RB5009 |
Rust v6 |
23ms |
36ms |
Optimized Binary Heap Ops by scottlamb |
Rust Rayon |
9ms |
22ms |
Parallelize by masmullin2000 |
Rust Rayon |
8ms |
22ms |
Remove comparison out of hot loop |
⠀ |
⠀ |
⠀ |
⠀ |
Go |
- |
1.5s |
Initial |
Go v2 |
- |
80ms |
Add rust optimizations |
Go v3 |
56ms |
70ms |
Use goccy/go-json |
Go v3 |
34ms |
55ms |
Use generic binaryheap by DrBlury |
Go v4 |
26ms |
50ms |
Replace binary heap with custom priority queue |
Go v5 |
20ms |
43ms |
Remove comparison out of hot loop |
Go Con |
10ms |
33ms |
Go concurrency by tirprox and DrBlury |
Go Con v2 |
5ms |
29ms |
Use arena, use waitgroup, rm binheap by DrBlury |
⠀ |
⠀ |
⠀ |
⠀ |
Python |
- |
7.81s |
Initial |
Python v2 |
1.35s |
1.53s |
Add rust optimizations by dave-andersen |
Numpy |
0.57s |
0.85s |
Numpy implementation by Copper280z |
⠀ |
⠀ |
⠀ |
⠀ |
Crystal |
50ms |
96ms |
Inital w/ previous optimizations |
Crystal v2 |
33ms |
72ms |
Replace binary heap with custom priority queue |
⠀ |
⠀ |
⠀ |
⠀ |
Odin |
110ms |
397ms |
Ported from golang code |
Odin v2 |
104ms |
404ms |
Remove comparison out of hot loop |
⠀ |
⠀ |
⠀ |
⠀ |
Dart VM |
125ms |
530ms |
Ported frog golang code |
Dart bin |
274ms |
360ms |
Compiled executable |
⠀ |
⠀ |
⠀ |
⠀ |
Vlang |
339ms |
560ms |
Ported from golang code |
⠀ |
⠀ |
⠀ |
⠀ |
Zig |
80ms |
110ms |
Provided by akhildevelops |