Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Very Large Hex Combinations

by Anonymous Monk
on Aug 04, 2005 at 14:50 UTC ( #480853=note: print w/replies, xml ) Need Help??

in reply to Very Large Hex Combinations

If you have a 64-bit Perl, a simple
for my $x (0 .. 0x7FFFFFFFFFFFFFFF) { printf "%016x\n", $x }
will keep you occupied for 168351 years if you can print a billion lines per second.

For a 32 bit Perl, use something like:

for my $x1 (0 .. 0x7F) { for my $x2 (0 .. 0xFFFFFFF) { for my $x3 (0 .. 0xFFFFFFF) { printf "%02x%07x%07x", $x1, $x2, $x3; } } }
for the same range and running time.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (1)
As of 2017-06-27 12:44 GMT
Find Nodes?
    Voting Booth?
    How many monitors do you use while coding?

    Results (605 votes). Check out past polls.