Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^2: One for the weekend: challenge

by karavelov (Monk)
on Jun 01, 2008 at 21:30 UTC ( #689599=note: print w/replies, xml ) Need Help??

in reply to Re: One for the weekend: challenge
in thread One for the weekend: challenge

Amazing! It runs very fast! Here it runs for 0,6 seconds on the standard set of 1000 numbers (compared to 2.2 sec my code). With growing the set of numbers they are comparable in speed - for 50000 numbers they are equal 13.7 seconds. It seems that I am hurt by the regex compile time.

I think your code is better than mine because :
1. you do not relay on some experimental features and recent optimizations;
2. The difference is in how we get the possible correct continuations of the number. My code generates them with the hairy regular expression. Your code generates all possible continuations and filter only the correct ones trough hash lookup.
3. less is more

Best regards

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://689599]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2018-03-20 04:56 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (247 votes). Check out past polls.