时间:2021-07-01 10:21:17 帮助过:5人阅读
// 创建一亿个QQ号的txt (大约需85~100秒)
set_time_limit(0);
$fn = 'qq.txt';
$fp = fopen($fn, 'w');
$st = microtime(true);
$l = range(0,10000);
shuffle($l);
foreach ($l as $k=>$v)
{
$arr = range($v*10000+10000,10000*($v+1)+9999);
shuffle($arr);
fputs($fp,implode("\n", $arr)."\n");
unset($arr);
}
echo microtime(true)-$st;
?>
// 长度号码分类 (大约需360~400秒)
set_time_limit(0);
$st = microtime(true);
if(!is_dir('qq_no')) mkdir('qq_no');
$file = fopen('qq.txt', 'r');
$i=0;
$end_s = '';
while(!feof($file))
{
$g = 1042*1024;
fseek($file,$g*$i);
$s = fread($file, $g);
$end = strrpos($s, "\n");
$arr_s = $end_s.substr($s, 0, $end);
$end_s = substr($s, $end);
$arr = explode("\n", $arr_s);
foreach ($arr as $k=>$v)
{
if($v!='')
{
$tag = "$v[0]$v[1]$v[2]";
$text_arr[strlen($v)][$tag][] = $v;
}
}
foreach ($text_arr as $k=>$v)
{
$n_dir = 'qq_no/'.$k;
if (!is_dir($n_dir)) mkdir($n_dir);
foreach ($v as $tag=>$val)
{
$n_tf = fopen($n_dir.'/'.$tag.'.txt', 'a+');
fputs($n_tf,implode("\n",$val)."\n");
}
}
unset($text_arr);
++$i;
}
echo microtime(true)-$st;
?>
// 排序完成拉 (800~920秒)
set_time_limit(0);
$st = microtime(true);
$qq_done = fopen('qq_done.txt', 'a+');
$root = 'qq_no';
$dir_array = scandir($root);
foreach ($dir_array as $key=>$val)
{
if ($val != '.' && $val != '..')
$dirs[$val] = scandir($root.'/'.$val);
}
foreach ($dirs as $key=>$val)
{
foreach ($val as $v)
{
if ($v != '.' && $v != '..')
{
$file = $root. '/' . $key . '/'. $v;
$c = file_get_contents($file);
$arr = explode("\n", $c);
sort($arr);
fputs($qq_done, implode("\n",$arr));
unlink($file);
}
}
rmdir($root. '/' . $key);
}
rmdir($root);
echo microtime(true)-$st;
?>
#include
#define BITSPERWORD 32
#define SHIFT 5
#define MASK 0x1F
#define N 100000000
int a[1 + N/BITSPERWORD];
void set(int i)