num-bigint
advent-of-code
num-bigint | advent-of-code | |
---|---|---|
4 | 2 | |
503 | 0 | |
1.4% | - | |
7.0 | 0.0 | |
8 days ago | 5 months ago | |
Rust | TypeScript | |
Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
num-bigint
-
Announcing Rust 1.59.0
I'm trying div for real: https://github.com/rust-num/num-bigint/pull/236
-
Revisiting Prechelt’s paper and follow-ups comparing Java, Lisp, C/C++ and scripting languages (incl. CL VS Java VS Rust benchmark)
Using an enum to simulate dynamic typing: https://github.com/philipc/prechelt-phone-number-encoding/tree/rust-number. This should be similar to the performance improvements from something like https://github.com/rust-num/num-bigint/issues/36, which means suboptimal use doesn't hurt as much.
-
A single issue with Rust that kills me every time with mathematics (rust repo issue 20671)
edit: See for example https://github.com/rust-num/num-bigint/blob/7562ab24330792817e42b808f60b0cac51ca261a/src/macros.rs
- [2020 Day 23] Indiana Jones and the Crab Raft
advent-of-code
-
[2021 Day 23 (Part 2)] [Typescript] Please help me optimize my code!
So I wrote some code that can solve Part 1 of Day 23 in about 1.6 seconds for the sample input, and about 53 seconds for my actual input. Not great, but okay. It uses the A* implementation I originally wrote for Day 15, and then modularized for Day 23 (and hopefully future years). Then I updated the code for Part 2 (in two separate commits, this and this). These updates made it significantly worse. :/ Now, when I run Part 1 for the sample input, it takes about 10 seconds to find the answer. Earlier, I started it looking for the Part 2 answer on the sample input, then went and ate dinner and watched a TV show, and 45+ minutes later, it was still running and hadn't found the solution yet, so I killed it. Does anyone have any suggestions on what I might have done to make things so much worse, and/or how to optimize what I have now? I don't mind something that takes a couple of minutes potentially to find the solution, maybe even up to 10-15 minutes on a hefty problem, but this is going to take forever to find the solution.
-
[2020 Day 23] Indiana Jones and the Crab Raft
As someone who has completed every year of Advent of Code so far, I read Part 1 and said to myself, "I'd better just go ahead and use a linked list for this; part 2's gonna be huge." My AoC project (in TypeScript) has my own custom doubly-linked list implementation that has served me pretty well. My runtime for part 2 of this challenge was ~14 seconds.
What are some alternatives?
num-primes - A Rust Library For Generating Large Composite, Prime, and Safe Prime Numbers
AoC20 - My solutions for Advent of Code 2020
num - A collection of numeric types and traits for Rust.
Nu - Repository hosting the open-source Nu Game Engine and related projects.
OpenZKP - OpenZKP - pure Rust implementations of Zero-Knowledge Proof systems.
prechelt-phone-number-encoding - Comparison between Java and Common Lisp solutions to a phone-encoding problem described by Prechelt
proc-macro-workshop - Learn to write Rust procedural macros [Rust Latam conference, Montevideo Uruguay, March 2019]
cargo-incremental - A fuzzing tool for incremental compilation that walks git history
rfcs - RFCs for changes to Rust
style - css for rust
prechelt-phone-number-encoding - Comparison between Java and Common Lisp solutions to a phone-encoding problem described by Prechelt