Hacker's Delight

Distribution List

Join the Hacker's distribution list to be notified of new challenges, updates, and results. The list is "announce only" - members are not allowed post (so, the traffic on the list should be quite low). You can join and leave the list freely by e-mailing the links below,

hackers-join@hejl.com	Join the list.
hackers-leave@hejl.com	Leave the list.

Listing of Challenges

Problem 1

Unpublished

Problem 2

Unpublished

Problem 3

Unpublished

Problem 4

Unpublished

Problem 5

Unpublished

Problem 6 : 64 Choose 4

Consider all the possible combinations of 4 bits in a 64-bit word. There are 635,376 possible combinations. The task is to enumerate each of these unique combinations exactly once until all 635,376 have been written into an array. Although order does not matter, no value can be duplicated. The challenge is to write the fastest function possible to enumerate all possible combinations of 4 bits in a 64-bit word.

8/17 @ 07:30pm EST Problem clarification. Extended due date
8/19 @ 08:00am EST Added Test Harness
9/03 @ 10:30am EST Closed challenge
9/06 @ 09:00am EST Results will be posted Sept 10th!
9/10 @ 11:59pm EST Results Posted

Problem 7 : Nearest Neighbor

Provided cloud of three dimensional points, the challenge is to write the fastest function possible to find the distance between the two closest.

10/20 @ 11:59pm EST Opened challenge
12/08 @ 12:26pm EST Extended due date: 1/2/07
01/02 @ 11:56pm EST Closed challenge
07/09 @ 12:21pm PST Hacker's Delight lives on in Vancouver. Results coming soon.
07/09 @ 06:29pm PST Results Posted

Problem 8 : Matrix Flip

08/30 @ 11:59pm PST Opened challenge. Due date is 10/31 at midnight.