←back to thread

Google's “Director of Engineering” Hiring Test

(www.gwan.com)
1764 points fatihky | 3 comments | 13 Oct 16 15:15 UTC | HN request time: 0.725s | source
Show context
jblow ◴[13 Oct 16 16:07 UTC] No.12701702[source]▶
#9 is especially stupid because it's so context-dependent. SSE4 gives you a popcount instruction, for example, which would be easily the fastest way to do this, if available.
replies(2): >>12702641 #>>12702679 #
greyman ◴[13 Oct 16 17:56 UTC] No.12702679[source]▶
Yes, but without that instruction, the algorithm mentioned by recruiter is really the quickest way. I coded chess algorithm in the past and this was exactly the method top chess open-source engines used. But imho it is hard to figure that out without prior experience with this problem.
replies(3): >>12703390 #>>12703834 #>>12708561 #
1. monocasa ◴[13 Oct 16 19:31 UTC] No.12703390[source]▶
Yep. Went and tried the lookup method against a 5 step parallel shift and add method (which is the fastest bitwise way I know of without, and the lookup is ~5% faster than the bitwise way.

https://gist.github.com/monocasa/1d44a03cbd0170bfffc6a4a5c37...

replies(1): >>12703823 #
2. gcp ◴[13 Oct 16 20:35 UTC] No.12703823[source]▶
Your code has 6 shifts, 6 adds/subs and 6 ANDs.

You can do it with 4 shifts, 3 adds, 1 MUL and 4 ANDs.

Your code is simply suboptimal.

replies(1): >>12704051 #
3. monocasa ◴[13 Oct 16 21:09 UTC] No.12704051[source]▶
For a 64bit quantity? I'm curious to see your algorithm in actual code.