D:\_KAZE_Gamera_TAR_revision14>dir *.tar Volume in drive D is S640_Vol5 Volume Serial Number is F85D-148B Directory of D:\_KAZE_Gamera_TAR_revision14 11/25/2011 04:28 AM 34,273,505,280 _Gamera.tar D:\_KAZE_Gamera_TAR_revision14>dir *.exe Volume in drive D is S640_Vol5 Volume Serial Number is F85D-148B Directory of D:\_KAZE_Gamera_TAR_revision14 11/25/2011 04:28 AM 769,024 GRAFFITH_r2++_Graphein.exe 11/28/2011 06:06 AM 103,424 Leprechaun_x-leton_32bit_doubleton_1pass.exe 11/28/2011 06:06 AM 103,424 Leprechaun_x-leton_32bit_doubleton_8passes.exe 11/28/2011 06:01 AM 104,448 Leprechaun_x-leton_32bit_quadrupleton_1pass.exe 11/28/2011 06:00 AM 104,448 Leprechaun_x-leton_32bit_quadrupleton_64passes.exe 11/30/2011 02:53 AM 105,472 Leprechaun_x-leton_32bit_quintupleton_64passes.exe 11/30/2011 02:53 AM 105,984 Leprechaun_x-leton_32bit_septupleton_64passes.exe 11/30/2011 02:53 AM 105,984 Leprechaun_x-leton_32bit_sextupleton_64passes.exe 11/28/2011 06:07 AM 103,424 Leprechaun_x-leton_32bit_singleton_2passes.exe 11/28/2011 06:02 AM 103,936 Leprechaun_x-leton_32bit_tripleton_1pass.exe 11/28/2011 06:04 AM 103,936 Leprechaun_x-leton_32bit_tripleton_32passes.exe 11/25/2011 04:28 AM 70,656 QuickSortExternal_4+GB.exe D:\_KAZE_Gamera_TAR_revision14>type RIP_7-leton.bat @echo off dir %1/b>%1.lst Leprechaun_x-leton_32bit_septupleton_64passes.exe %1.lst %1.7 1500000 Y echo. type Leprechaun.LOG echo. "QuickSortExternal_4+GB.exe" %1.7 /fast echo. ren "QuickSortExternal_4+GB.txt" %1.7.sorted del QuickSortExternal_4+GB.distinct.txt GRAFFITH_r2++_Graphein.exe e %1.7.sorted %1.7.sorted.bsc -m0fb1 echo. dir %1.7* echo. D:\_KAZE_Gamera_TAR_revision14>RIP_7-leton.bat _Gamera.tar Leprechaun_septupleton (Fast-In-Future Greedy n-gram-Ripper), rev. 15, written by Svalqyatchx. Purpose: Rips all distinct 7-grams (7-word phrases) with length 25..81 chars from incoming texts. Feature1: All words within x-lets/n-grams are in range 1..31 chars inclusive. Feature2: In this revision 128MB 1-way hash is used which results in 16,777,216 external B-Trees of order 3. Feature3: In this revision 64 passes are to be made. Feature4: If the external memory has latency 99+microseconds then !(look no further), IOPS(seek-time) rules. Pass #1 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,648,320P/s; Phrase count: 889,495,472 of them 8,197,006 distinct; Done: 64/64 Bytes per second performance: 24,980,688B/s Phrases per second performance: 648,320P/s Time for putting phrases into trees: 1372 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,934P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #2 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,614,292P/s; Phrase count: 889,495,472 of them 8,189,135 distinct; Done: 64/64 Bytes per second performance: 23,669,547B/s Phrases per second performance: 614,292P/s Time for putting phrases into trees: 1448 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,641P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #3 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,674,371P/s; Phrase count: 889,495,472 of them 8,193,162 distinct; Done: 64/64 Bytes per second performance: 25,984,461B/s Phrases per second performance: 674,371P/s Time for putting phrases into trees: 1319 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,145P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #4 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,649,741P/s; Phrase count: 889,495,472 of them 8,189,700 distinct; Done: 64/64 Bytes per second performance: 25,035,431B/s Phrases per second performance: 649,741P/s Time for putting phrases into trees: 1369 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,712P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #5 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,645,966P/s; Phrase count: 889,495,472 of them 8,193,542 distinct; Done: 64/64 Bytes per second performance: 24,889,982B/s Phrases per second performance: 645,966P/s Time for putting phrases into trees: 1377 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,472P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #6 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,681,083P/s; Phrase count: 889,495,472 of them 8,193,020 distinct; Done: 64/64 Bytes per second performance: 26,243,112B/s Phrases per second performance: 681,083P/s Time for putting phrases into trees: 1306 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,402P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #7 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,599,794P/s; Phrase count: 889,495,472 of them 8,194,938 distinct; Done: 64/64 Bytes per second performance: 23,110,927B/s Phrases per second performance: 599,794P/s Time for putting phrases into trees: 1483 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,658P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #8 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,682,651P/s; Phrase count: 889,495,472 of them 8,192,137 distinct; Done: 64/64 Bytes per second performance: 26,303,534B/s Phrases per second performance: 682,651P/s Time for putting phrases into trees: 1303 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,017P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #9 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,618,564P/s; Phrase count: 889,495,472 of them 8,189,725 distinct; Done: 64/64 Bytes per second performance: 23,834,148B/s Phrases per second performance: 618,564P/s Time for putting phrases into trees: 1438 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,715P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #10 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,592,601P/s; Phrase count: 889,495,472 of them 8,191,042 distinct; Done: 64/64 Bytes per second performance: 22,833,780B/s Phrases per second performance: 592,601P/s Time for putting phrases into trees: 1501 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,880P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #11 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,621,156P/s; Phrase count: 889,495,472 of them 8,188,680 distinct; Done: 64/64 Bytes per second performance: 23,934,012B/s Phrases per second performance: 621,156P/s Time for putting phrases into trees: 1432 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,585P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #12 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,597,779P/s; Phrase count: 889,495,472 of them 8,187,905 distinct; Done: 64/64 Bytes per second performance: 23,033,269B/s Phrases per second performance: 597,779P/s Time for putting phrases into trees: 1488 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,488P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #13 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,665,292P/s; Phrase count: 889,495,472 of them 8,194,605 distinct; Done: 64/64 Bytes per second performance: 25,634,633B/s Phrases per second performance: 665,292P/s Time for putting phrases into trees: 1337 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,325P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #14 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,618,564P/s; Phrase count: 889,495,472 of them 8,191,656 distinct; Done: 64/64 Bytes per second performance: 23,834,148B/s Phrases per second performance: 618,564P/s Time for putting phrases into trees: 1438 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,957P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #15 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,602,639P/s; Phrase count: 889,495,472 of them 8,188,466 distinct; Done: 64/64 Bytes per second performance: 23,220,532B/s Phrases per second performance: 602,639P/s Time for putting phrases into trees: 1476 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,558P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #16 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,667,288P/s; Phrase count: 889,495,472 of them 8,191,004 distinct; Done: 64/64 Bytes per second performance: 25,711,556B/s Phrases per second performance: 667,288P/s Time for putting phrases into trees: 1333 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,133P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #17 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,660,352P/s; Phrase count: 889,495,472 of them 8,192,305 distinct; Done: 64/64 Bytes per second performance: 25,444,324B/s Phrases per second performance: 660,352P/s Time for putting phrases into trees: 1347 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,038P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #18 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,667,789P/s; Phrase count: 889,495,472 of them 8,194,541 distinct; Done: 64/64 Bytes per second performance: 25,730,859B/s Phrases per second performance: 667,789P/s Time for putting phrases into trees: 1332 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,317P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #19 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,680,562P/s; Phrase count: 889,495,472 of them 8,190,471 distinct; Done: 64/64 Bytes per second performance: 26,223,033B/s Phrases per second performance: 680,562P/s Time for putting phrases into trees: 1307 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,808P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #20 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,600,604P/s; Phrase count: 889,495,472 of them 8,192,900 distinct; Done: 64/64 Bytes per second performance: 23,142,137B/s Phrases per second performance: 600,604P/s Time for putting phrases into trees: 1481 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,112P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #21 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,643,629P/s; Phrase count: 889,495,472 of them 8,189,259 distinct; Done: 64/64 Bytes per second performance: 24,799,931B/s Phrases per second performance: 643,629P/s Time for putting phrases into trees: 1382 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,657P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #22 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,585,194P/s; Phrase count: 889,495,472 of them 8,190,891 distinct; Done: 64/64 Bytes per second performance: 22,548,358B/s Phrases per second performance: 585,194P/s Time for putting phrases into trees: 1520 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,861P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #23 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,636,718P/s; Phrase count: 889,495,472 of them 8,190,598 distinct; Done: 64/64 Bytes per second performance: 24,533,647B/s Phrases per second performance: 636,718P/s Time for putting phrases into trees: 1397 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,963,599P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #24 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,666,788P/s; Phrase count: 889,495,472 of them 8,190,074 distinct; Done: 64/64 Bytes per second performance: 25,692,282B/s Phrases per second performance: 666,788P/s Time for putting phrases into trees: 1334 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,759P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #25 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,618,994P/s; Phrase count: 889,495,472 of them 8,192,033 distinct; Done: 64/64 Bytes per second performance: 23,850,734B/s Phrases per second performance: 618,994P/s Time for putting phrases into trees: 1437 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,004P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #26 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,579,853P/s; Phrase count: 889,495,472 of them 8,187,845 distinct; Done: 64/64 Bytes per second performance: 22,342,571B/s Phrases per second performance: 579,853P/s Time for putting phrases into trees: 1534 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,480P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #27 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,551,454P/s; Phrase count: 889,495,472 of them 8,190,145 distinct; Done: 64/64 Bytes per second performance: 21,248,298B/s Phrases per second performance: 551,454P/s Time for putting phrases into trees: 1613 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,768P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #28 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,574,238P/s; Phrase count: 889,495,472 of them 8,196,189 distinct; Done: 64/64 Bytes per second performance: 22,126,213B/s Phrases per second performance: 574,238P/s Time for putting phrases into trees: 1549 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,910,687P/s Time for shaking phrases from trees: 18 second(s) Leprechaun: Current pass done. Pass #29 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,537,134P/s; Phrase count: 889,495,472 of them 8,189,819 distinct; Done: 64/64 Bytes per second performance: 20,696,561B/s Phrases per second performance: 537,134P/s Time for putting phrases into trees: 1656 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,727P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #30 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,516,547P/s; Phrase count: 889,495,472 of them 8,195,336 distinct; Done: 64/64 Bytes per second performance: 19,903,313B/s Phrases per second performance: 516,547P/s Time for putting phrases into trees: 1722 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,964,157P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #31 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,498,596P/s; Phrase count: 889,495,472 of them 8,192,843 distinct; Done: 64/64 Bytes per second performance: 19,211,606B/s Phrases per second performance: 498,596P/s Time for putting phrases into trees: 1784 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,963,863P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #32 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,558,027P/s; Phrase count: 889,495,472 of them 8,187,496 distinct; Done: 64/64 Bytes per second performance: 21,501,571B/s Phrases per second performance: 558,027P/s Time for putting phrases into trees: 1594 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,861,841P/s Time for shaking phrases from trees: 19 second(s) Leprechaun: Current pass done. Pass #33 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,382,743P/s; Phrase count: 889,495,472 of them 8,196,160 distinct; Done: 64/64 Bytes per second performance: 14,747,635B/s Phrases per second performance: 382,743P/s Time for putting phrases into trees: 2324 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,964,254P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #34 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,585,965P/s; Phrase count: 889,495,472 of them 8,194,041 distinct; Done: 64/64 Bytes per second performance: 22,578,066B/s Phrases per second performance: 585,965P/s Time for putting phrases into trees: 1518 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,255P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #35 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,568,731P/s; Phrase count: 889,495,472 of them 8,191,226 distinct; Done: 64/64 Bytes per second performance: 21,914,005B/s Phrases per second performance: 568,731P/s Time for putting phrases into trees: 1564 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,963,673P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #36 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,567,642P/s; Phrase count: 889,495,472 of them 8,186,899 distinct; Done: 64/64 Bytes per second performance: 21,872,051B/s Phrases per second performance: 567,642P/s Time for putting phrases into trees: 1567 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,362P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #37 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,601,823P/s; Phrase count: 889,495,472 of them 8,195,569 distinct; Done: 64/64 Bytes per second performance: 23,189,110B/s Phrases per second performance: 601,823P/s Time for putting phrases into trees: 1478 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,742P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #38 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,584,425P/s; Phrase count: 889,495,472 of them 8,191,976 distinct; Done: 64/64 Bytes per second performance: 22,518,728B/s Phrases per second performance: 584,425P/s Time for putting phrases into trees: 1522 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,263P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #39 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,683,176P/s; Phrase count: 889,495,472 of them 8,194,104 distinct; Done: 64/64 Bytes per second performance: 26,323,736B/s Phrases per second performance: 683,176P/s Time for putting phrases into trees: 1302 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,547P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #40 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,666,288P/s; Phrase count: 889,495,472 of them 8,191,298 distinct; Done: 64/64 Bytes per second performance: 25,673,037B/s Phrases per second performance: 666,288P/s Time for putting phrases into trees: 1335 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,173P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #41 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,592,996P/s; Phrase count: 889,495,472 of them 8,187,576 distinct; Done: 64/64 Bytes per second performance: 22,849,003B/s Phrases per second performance: 592,996P/s Time for putting phrases into trees: 1500 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,091,676P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #42 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,643,629P/s; Phrase count: 889,495,472 of them 8,194,939 distinct; Done: 64/64 Bytes per second performance: 24,799,931B/s Phrases per second performance: 643,629P/s Time for putting phrases into trees: 1382 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,658P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #43 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,639,005P/s; Phrase count: 889,495,472 of them 8,192,984 distinct; Done: 64/64 Bytes per second performance: 24,621,771B/s Phrases per second performance: 639,005P/s Time for putting phrases into trees: 1392 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,123P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #44 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,646,905P/s; Phrase count: 889,495,472 of them 8,191,524 distinct; Done: 64/64 Bytes per second performance: 24,926,185B/s Phrases per second performance: 646,905P/s Time for putting phrases into trees: 1375 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,940P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #45 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,679,522P/s; Phrase count: 889,495,472 of them 8,186,698 distinct; Done: 64/64 Bytes per second performance: 26,182,968B/s Phrases per second performance: 679,522P/s Time for putting phrases into trees: 1309 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,091,559P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #46 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,679,522P/s; Phrase count: 889,495,472 of them 8,194,393 distinct; Done: 64/64 Bytes per second performance: 26,182,968B/s Phrases per second performance: 679,522P/s Time for putting phrases into trees: 1309 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,585P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #47 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,602,639P/s; Phrase count: 889,495,472 of them 8,193,210 distinct; Done: 64/64 Bytes per second performance: 23,220,532B/s Phrases per second performance: 602,639P/s Time for putting phrases into trees: 1476 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,428P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #48 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,647,376P/s; Phrase count: 889,495,472 of them 8,191,071 distinct; Done: 64/64 Bytes per second performance: 24,944,326B/s Phrases per second performance: 647,376P/s Time for putting phrases into trees: 1374 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,142P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #49 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,679,522P/s; Phrase count: 889,495,472 of them 8,197,470 distinct; Done: 64/64 Bytes per second performance: 26,182,968B/s Phrases per second performance: 679,522P/s Time for putting phrases into trees: 1309 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,996P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #50 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,594,980P/s; Phrase count: 889,495,472 of them 8,192,179 distinct; Done: 64/64 Bytes per second performance: 22,925,421B/s Phrases per second performance: 594,980P/s Time for putting phrases into trees: 1495 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,022P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #51 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,601,416P/s; Phrase count: 889,495,472 of them 8,188,073 distinct; Done: 64/64 Bytes per second performance: 23,173,431B/s Phrases per second performance: 601,416P/s Time for putting phrases into trees: 1479 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,509P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #52 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,663,307P/s; Phrase count: 889,495,472 of them 8,194,317 distinct; Done: 64/64 Bytes per second performance: 25,558,169B/s Phrases per second performance: 663,307P/s Time for putting phrases into trees: 1341 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,575P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #53 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,653,080P/s; Phrase count: 889,495,472 of them 8,190,618 distinct; Done: 64/64 Bytes per second performance: 25,164,100B/s Phrases per second performance: 653,080P/s Time for putting phrases into trees: 1362 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,827P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #54 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,601,010P/s; Phrase count: 889,495,472 of them 8,197,239 distinct; Done: 64/64 Bytes per second performance: 23,157,773B/s Phrases per second performance: 601,010P/s Time for putting phrases into trees: 1480 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,654P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #55 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,673,350P/s; Phrase count: 889,495,472 of them 8,192,589 distinct; Done: 64/64 Bytes per second performance: 25,945,121B/s Phrases per second performance: 673,350P/s Time for putting phrases into trees: 1321 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,073P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #56 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,638,088P/s; Phrase count: 889,495,472 of them 8,197,516 distinct; Done: 64/64 Bytes per second performance: 24,586,445B/s Phrases per second performance: 638,088P/s Time for putting phrases into trees: 1394 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,689P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #57 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,669,800P/s; Phrase count: 889,495,472 of them 8,190,326 distinct; Done: 64/64 Bytes per second performance: 25,808,362B/s Phrases per second performance: 669,800P/s Time for putting phrases into trees: 1328 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,963,567P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #58 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,639,005P/s; Phrase count: 889,495,472 of them 8,194,253 distinct; Done: 64/64 Bytes per second performance: 24,621,771B/s Phrases per second performance: 639,005P/s Time for putting phrases into trees: 1392 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,024,281P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #59 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,679,522P/s; Phrase count: 889,495,472 of them 8,187,262 distinct; Done: 64/64 Bytes per second performance: 26,182,968B/s Phrases per second performance: 679,522P/s Time for putting phrases into trees: 1309 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,963,207P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #60 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,591,026P/s; Phrase count: 889,495,472 of them 8,187,294 distinct; Done: 64/64 Bytes per second performance: 22,773,093B/s Phrases per second performance: 591,026P/s Time for putting phrases into trees: 1505 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,411P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #61 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,680,562P/s; Phrase count: 889,495,472 of them 8,194,583 distinct; Done: 64/64 Bytes per second performance: 26,223,033B/s Phrases per second performance: 680,562P/s Time for putting phrases into trees: 1307 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 00,964,068P/s Time for shaking phrases from trees: 17 second(s) Leprechaun: Current pass done. Pass #62 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,580,989P/s; Phrase count: 889,495,472 of them 8,188,538 distinct; Done: 64/64 Bytes per second performance: 22,386,352B/s Phrases per second performance: 580,989P/s Time for putting phrases into trees: 1531 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,023,567P/s Time for shaking phrases from trees: 16 second(s) Leprechaun: Current pass done. Pass #63 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,615,567P/s; Phrase count: 889,495,472 of them 8,193,435 distinct; Done: 64/64 Bytes per second performance: 23,718,688B/s Phrases per second performance: 615,567P/s Time for putting phrases into trees: 1445 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,458P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Pass #64 of 64: Size of input file with files for Leprechauning: 13 Allocating HASH memory 134,217,793 bytes ... OK Allocating memory 1465MB ... OK Size of Input TEXTual file: 34,273,505,280 /; 00,595,378P/s; Phrase count: 889,495,472 of them 8,191,943 distinct; Done: 64/64 Bytes per second performance: 22,940,766B/s Phrases per second performance: 595,378P/s Time for putting phrases into trees: 1494 second(s) Flushing UNsorted phrases: 100%; Shaking trees performance: 01,092,259P/s Time for shaking phrases from trees: 15 second(s) Leprechaun: Current pass done. Total memory needed for one pass: 74,669,323KB Total distinct phrases: 524,279,771 Total time: 93668 second(s) Total performance: 9,496P/s i.e. phrases per second Leprechaun: Done. Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,934,862 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,837,398 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,491 Total Attempts to Find/Put WORDs into B-trees order 3: 38,772,185 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,926,991 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,377 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,339 Total Attempts to Find/Put WORDs into B-trees order 3: 38,619,493 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,931,018 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,531 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,942 Total Attempts to Find/Put WORDs into B-trees order 3: 38,505,363 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,927,556 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,353 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,717 Total Attempts to Find/Put WORDs into B-trees order 3: 39,816,018 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,931,398 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,511 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,747 Total Attempts to Find/Put WORDs into B-trees order 3: 38,581,929 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,876 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,332 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,904 Total Attempts to Find/Put WORDs into B-trees order 3: 38,659,770 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,794 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,417 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,112 Total Attempts to Find/Put WORDs into B-trees order 3: 39,524,719 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,993 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,103 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,860 Total Attempts to Find/Put WORDs into B-trees order 3: 38,550,196 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,927,581 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,711 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,402 Total Attempts to Find/Put WORDs into B-trees order 3: 40,071,083 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,898 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,652 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,583 Total Attempts to Find/Put WORDs into B-trees order 3: 38,525,824 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,926,536 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,830,070 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,088 Total Attempts to Find/Put WORDs into B-trees order 3: 38,587,436 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,761 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,016 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,461 Total Attempts to Find/Put WORDs into B-trees order 3: 39,508,584 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,461 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,704 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,167 Total Attempts to Find/Put WORDs into B-trees order 3: 38,594,444 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,512 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,343 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,523 Total Attempts to Find/Put WORDs into B-trees order 3: 38,652,072 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,926,322 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,830,869 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,241 Total Attempts to Find/Put WORDs into B-trees order 3: 41,401,263 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,860 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,629 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,578 Total Attempts to Find/Put WORDs into B-trees order 3: 38,545,311 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,161 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,190 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,877 Total Attempts to Find/Put WORDs into B-trees order 3: 38,454,221 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,397 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,839 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,193 Total Attempts to Find/Put WORDs into B-trees order 3: 38,634,386 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,327 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,652 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,391 Total Attempts to Find/Put WORDs into B-trees order 3: 38,564,190 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,756 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,463 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,738 Total Attempts to Find/Put WORDs into B-trees order 3: 38,621,960 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,927,115 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,830,487 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,168 Total Attempts to Find/Put WORDs into B-trees order 3: 38,730,094 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,747 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,043 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,275 Total Attempts to Find/Put WORDs into B-trees order 3: 38,587,304 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,454 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,232 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,502 Total Attempts to Find/Put WORDs into B-trees order 3: 38,608,524 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,927,930 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,260 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,508 Total Attempts to Find/Put WORDs into B-trees order 3: 39,468,678 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,889 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,838 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,810 Total Attempts to Find/Put WORDs into B-trees order 3: 40,307,050 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,701 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,830,602 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,190 Total Attempts to Find/Put WORDs into B-trees order 3: 39,473,638 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,001 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,830,978 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,262 Total Attempts to Find/Put WORDs into B-trees order 3: 39,818,305 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,934,045 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,836,239 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,269 Total Attempts to Find/Put WORDs into B-trees order 3: 38,592,025 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,927,675 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,311 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,326 Total Attempts to Find/Put WORDs into B-trees order 3: 40,408,728 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,933,192 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,372 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,103 Total Attempts to Find/Put WORDs into B-trees order 3: 38,746,000 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,699 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,858 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,813 Total Attempts to Find/Put WORDs into B-trees order 3: 38,663,537 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,352 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,829,516 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,165,982 Total Attempts to Find/Put WORDs into B-trees order 3: 40,000,536 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,934,016 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,520 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,132 Total Attempts to Find/Put WORDs into B-trees order 3: 40,351,430 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,931,897 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,836,345 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,289 Total Attempts to Find/Put WORDs into B-trees order 3: 38,635,625 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,082 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,293 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,514 Total Attempts to Find/Put WORDs into B-trees order 3: 38,667,708 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,924,755 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,829,662 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,010 Total Attempts to Find/Put WORDs into B-trees order 3: 38,523,761 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,933,425 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,837,515 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,513 Total Attempts to Find/Put WORDs into B-trees order 3: 38,562,216 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,832 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,642 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,389 Total Attempts to Find/Put WORDs into B-trees order 3: 38,742,704 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,931,960 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,331 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,904 Total Attempts to Find/Put WORDs into B-trees order 3: 38,574,230 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,154 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,139 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,867 Total Attempts to Find/Put WORDs into B-trees order 3: 40,160,584 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,432 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,829,696 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,017 Total Attempts to Find/Put WORDs into B-trees order 3: 38,527,414 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,795 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,533 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,134 Total Attempts to Find/Put WORDs into B-trees order 3: 38,736,405 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,840 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,005 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,033 Total Attempts to Find/Put WORDs into B-trees order 3: 38,585,121 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,380 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,499 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,745 Total Attempts to Find/Put WORDs into B-trees order 3: 38,683,516 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,924,554 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,828,848 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,165,854 Total Attempts to Find/Put WORDs into B-trees order 3: 42,651,081 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,249 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,786 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,182 Total Attempts to Find/Put WORDs into B-trees order 3: 41,057,460 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,931,066 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,561 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,948 Total Attempts to Find/Put WORDs into B-trees order 3: 38,633,454 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,927 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,831,995 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,457 Total Attempts to Find/Put WORDs into B-trees order 3: 38,737,282 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,935,326 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,836,618 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,342 Total Attempts to Find/Put WORDs into B-trees order 3: 38,645,278 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,035 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,147 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,060 Total Attempts to Find/Put WORDs into B-trees order 3: 38,737,510 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,929 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,829,650 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,008 Total Attempts to Find/Put WORDs into B-trees order 3: 39,649,801 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,173 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,164 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,063 Total Attempts to Find/Put WORDs into B-trees order 3: 40,856,859 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,474 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,869 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,815 Total Attempts to Find/Put WORDs into B-trees order 3: 38,568,611 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,935,095 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,837,771 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,562 Total Attempts to Find/Put WORDs into B-trees order 3: 38,660,863 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,930,445 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,833,365 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,719 Total Attempts to Find/Put WORDs into B-trees order 3: 38,455,970 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,935,372 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,838,917 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,782 Total Attempts to Find/Put WORDs into B-trees order 3: 39,440,615 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,928,182 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,478 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,549 Total Attempts to Find/Put WORDs into B-trees order 3: 40,045,764 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,109 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,835,455 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,119 Total Attempts to Find/Put WORDs into B-trees order 3: 38,660,278 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,118 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,830,116 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,097 Total Attempts to Find/Put WORDs into B-trees order 3: 38,654,982 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,925,150 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,829,809 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,038 Total Attempts to Find/Put WORDs into B-trees order 3: 38,516,687 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,932,439 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,959 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,167,024 Total Attempts to Find/Put WORDs into B-trees order 3: 38,921,937 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,926,394 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,829,861 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,048 Total Attempts to Find/Put WORDs into B-trees order 3: 38,512,954 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,931,291 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,834,367 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,911 Total Attempts to Find/Put WORDs into B-trees order 3: 41,019,879 Leprechaun report: Number Of Hash Collisions(Distinct WORDs - Number Of Trees): 7,929,799 Number Of Trees(GREATER THE BETTER): 262,144 Number Of LEAFs(littler THE BETTER) not counting ROOT LEAFs: 5,832,930 Highest Tree not counting ROOT Level i.e. CORONA levels(littler THE BETTER): 4 Used value for third parameter in KB: 1,500,000 Use next time as third parameter: 1,166,636 Total Attempts to Find/Put WORDs into B-trees order 3: 38,634,219 QuickSortExternal_4+GB r.2+reversed, written by Kaze. Size of input file: 26,052,174,976 Counting lines ... QuickSortExternal_4+GB: Needed memory allocation denied! Graffith(graphite), Text decompressor-finder-dumper, r.02++_Graphein, written by Kaze. Graffith is a wrapper over bsc version 2.3.0, written by Ilya Grebnov. Volume in drive D is S640_Vol5 Volume Serial Number is F85D-148B Directory of D:\_KAZE_Gamera_TAR_revision14 12/05/2011 05:56 PM 26,052,174,976 _Gamera.tar.7 12/05/2011 05:56 PM 0 _Gamera.tar.7.sorted 12/05/2011 07:00 PM 0 _Gamera.tar.7.sorted.bsc D:\_KAZE_Gamera_TAR_revision14>type _Gamera.tar.7|more 0,000,002 will_use_the_color_keyword_invert_since 0,000,003 what_thoughts_must_the_son_of_god 0,000,001 who_durst_not_venture_to_look_behind 0,000,001 vibes_i_m_sending_you_right_there 0,000,001 traditionally_in_this_matter_only_institutions_in 0,000,001 undergo_a_rapid_growth_phase_during_the 0,000,003 was_something_in_ann_s_voice_and 0,000,001 the_voice_in_this_case_is_not 0,000,002 the_grace_of_praying_as_administered_in 0,000,001 suited_to_this_type_of_culture_are 0,000,001 the_daughter_of_zeus_and_dione_her 0,000,001 the_order_for_the_departure_to_begin 0,000,001 resection_oftumor_is_not_favored_because_ofthe 0,000,001 server_regarding_the_average_number_of_rows 0,000,001 of_self_help_could_be_rigidly_insisted 0,000,001 openly_sold_and_widely_circulated_in_america 0,000,001 pas_un_appendice_postiche_qu_on_ajoute 0,000,002 she_would_hide_it_in_the_bread 0,000,001 object_related_changes_to_visual_basic_syntax 0,000,001 itself_would_have_little_more_than_orange 0,000,001 made_by_demonstration_of_granulomatous_synovitis_and 0,000,001 imbalances_in_children_with_chronic_renal_failure 0,000,002 in_febrile_neutropenic_patients_with_hematological_malignancies 0,000,001 i_expect_no_complications_like_dope_in 0,000,003 i_therefore_ask_you_to_make_such 0,000,001 diaphragms_to_aid_in_placement_of_nonlumen 0,000,001 even_as_his_eyes_began_to_sparkle 0,000,001 but_does_not_create_a_fatal_flaw 0,000,001 changes_in_the_source_of_the_sediment 0,000,001 a_product_of_euro_american_media_sensationalism 0,000,001 akan_ketujuh_ekor_lembu_yang_elok_rupanya 0,000,001 components_may_have_been_custom_made_and 0,000,001 greatness_and_difficulty_of_such_an_enterprise 0,000,001 interchangeability_means_that_the_item_can_be 0,000,001 of_message_blanks_on_the_counter_top 0,000,004 those_who_carried_the_heads_on_iron 0,000,001 yorkfor_slaying_the_man_whohave_you_heard 0,000,003 wish_and_to_say_what_they_think 0,000,001 y_position_and_bounce_it_back_in 0,000,001 treated_with_a_serotonin_dopamine_antagonist_in 0,000,001 to_ask_permission_to_pick_up_the 0,000,003 to_serve_content_out_of_a_directory 0,000,001 the_time_little_janusz_was_born_some 0,000,002 the_influence_of_his_own_pacific_dispositions 0,000,001 the_minimum_common_subgraph_of_a_pair 0,000,001 the_option_of_last_choice_because_most 0,000,002 those_files_continued_to_be_freely_redistributed 0,000,001 will_you_be_ready_two_days_hence 0,000,001 sites_also_offer_a_wealth_of_investment 0,000,001 sun_at_any_moment_is_proof_that 0,000,001 paginya_daud_menulis_surat_kepada_yoab_dan 0,000,002 laid_down_in_our_best_modern_maps 0,000,001 mind_suddenly_to_a_less_agreeable_subject 0,000,005 people_are_distressed_more_because_you_are 0,000,001 from_a_specific_central_storage_location_named 0,000,001 he_had_evidently_made_a_very_careful 0,000,001 developed_by_burt_zimmerman_and_reported_in 0,000,005 for_reasons_to_which_i_had_to 0,000,001 data_may_now_be_regarded_as_a ^C D:\_KAZE_Gamera_TAR_revision14>