Viewing profile — nulptr
nulptr
HN member- Joined
- Tue, Apr 07, 2020, 7:26 PM UTC
- HN karma
- 24
- Public activity
- 19 items
- HN profile
- View on Hacker News ↗
About nulptr
No profile information was provided.
Recent public activity
-
comment
Comment #46676074
The +12 there is so that % works correctly (ie the number never becomes negative)
-
comment
Comment #40078021
Hard y… yt = white
-
comment
Comment #31462189
One way is querying the dht
-
comment
Comment #28896063
If each command would only be executed two communication turns in the future, and a communication turn is ~200ms, isn't there ~600ms of lag for each command? > For RTS games, 250 m…
-
comment
Comment #26194038
Yeah, this is irritating... one workaround for this is to do: (in the context of walking a tree...): fn get_depth(root_opt: &Option >) -> usize { let root = match root_opt { Some(r…
-
comment
Comment #25604913
Some starter code for each language that prints hello world would be nice. ALso, you can look to coderpad.io for other features to add for fun.
-
comment
Comment #25399856
important to note that there's little choice for men or women in the "happy multi generational example"
-
comment
Comment #25298790
were you applying for a data scientist or software engineer position?
-
comment
Comment #24749997
Ahh yes, that's very clever. Thanks for sharing :)
-
comment
Comment #24749479
I think I found a way to do it with ~8GB. As you mentioned you only need 2^30 tries due to birthday paradox. But, instead of using a hash table to store (seed, hash) pairs, we can …
-
comment
Comment #24747036
I have a question about how you generated collisions. If each seed is a 32-bit int, and each hash is 60 bits, then you'll have to store 92 bits for each (seed, hash) pair. With 2^3…
-
comment
Comment #24181437
I don't think it's just about solving the problem. It's also about: - how you convinced yourself and the interviewer that your solution was correct (essentially an informal proof o…
-
comment
Comment #24123002
rust allows for procedural macros (basically a function that takes a token stream and returns a token stream, and yes you can do parsing in this funciton https://doc.rust-lang.org/…
-
comment
Comment #24056327
If you accuse someone of theft, shouldn't the burden of proof be on you? Also, if two people make a bet, and one person wins, is that theft?
-
comment
Comment #23795782
because "ssdf" is a string but B("asd") is user-defined sum type. So in the original example, you can't unify "ssdf" and the int 33, but in the re-written version B("sfd") and A(33…
-
comment
Comment #23661479
https://outline.com/k74gf3
-
comment
Comment #23305509
https://webcache.googleusercontent.com/search?q=cache:21xq0j...
-
comment
Comment #23224072
Can someone explain why Uber stock is up 7% today then? Is it because Uber's expenditure will decrease because of the layoffs?
-
comment
Comment #22806594
Out of curiosity, what software were they using to catch cheating? Was it MOSS ( https://theory.stanford.edu/~aiken/moss/ )?