id
related bits
0
processing priority
4
site type
3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)
review version
11
html import
20 (imported)
first seen date
2024-03-30 00:30:56
expired found date
-
created at
2024-06-09 05:22:14
updated at
2026-01-02 03:10:48
length
18
crc
50520
tld
2211
nm parts
0
nm random digits
0
nm rare letters
0
is subdomain of id
13642151 (wordpress.com)
previous id
0
replaced with id
0
related id
-
dns primary id
0
dns alternative id
0
lifecycle status
0 (unclassified, or currently active)
deleted subdomains
0
page imported products
0
page imported random
0
page imported parking
0
count skipped due to recent timeouts on the same server IP
0
count content received but rejected due to 11-799
0
count dns errors
0
count cert errors
0
count timeouts
0
count http 429
0
count http 404
0
count http 403
0
count http 5xx
0
next operation date
-
server bits
—
server ip
-
mp import status
20
mp rejected date
-
mp saved date
-
mp size orig
121035
mp size raw text
10083
mp inner links count
129
mp inner links status
20 (imported)
title
Harder, Better, Faster, Stronger
description
Explorations in better, faster, stronger code.
site name
Harder, Better, Faster, Stronger
author
updated
2025-12-21 08:41:41
raw text
Harder, Better, Faster, Stronger | Explorations in better, faster, stronger code. Harder, Better, Faster, Stronger Explorations in better, faster, stronger code. Home About the author About this blog Bresenham’s Pie 29/03/2022 Approximating is always fun. Some approximations are well known, like Zu Chongzhi’s, , that is fairly precise (it gives 6 digits). We can derive a good approximation using continue fractions, series, or some spigot algorithm . We can also use Monte Carlo methods, such as drawing uniformly distributed values inside a square, count those who falls in the circle, then use the ratio of inside points to outside points to evaluate . This converges slowly. How do we evaluate the area of the circle then? Well, we could do it exhaustively, but in a smart way. Read the rest of this entry » Leave a Comment » | Uncategorized | Permalink Posted by Steven Pigeon Binary Trees are optimal… except when they’re not. 20/0...
redirect type
0 (-)
block type
0 (no issues)
detected language
1 (English)
category id
index version
2025110801
spam phrases
0
text nonlatin
0
text cyrillic
0
text characters
7181
text words
1433
text unique words
542
text lines
432
text sentences
51
text paragraphs
14
text words per sentence
28
text matched phrases
2
text matched dictionaries
6
links self subdomains
0
links other subdomains
0
links other domains
0
links spam adult
0
links spam random
0
links spam expired
0
links ext activities
0
links ext ecommerce
0
links ext finance
0
links ext crypto
0
links ext booking
0
links ext news
0
links ext leaks
0
links ext ugc
41 - s0.wp.com, widgets.wp.com, wp.me, secure.gravatar.com, s1.wp.com, hbfs.files.wordpress.com, en.wikipedia.org, twitter.com, debugfailure.wordpress.com, frankensteinslab.wordpress.com, lostwebsite.wordpress.com, gnuvince.wordpress.com, thetweaker.wordpress.com, wordpress.com
links ext klim
0
links ext generic
0
dol status
0
dol updated
2025-12-21 08:41:41
rss status
32 (unknown)
rss found date
2024-04-01 13:29:28
rss size orig
166314
rss items
10
rss spam phrases
0
rss detected language
1 (English)
inbefore feed id
-
inbefore status
0 (new)
sitemap path
sitemap status
30 (processing completed, results pushed to table crawler_sitemaps.ext_domain_sitemap_lists)
sitemap review version
1
sitemap urls count
608
sitemap urls adult
0
sitemap filtered products
0
sitemap filtered videos
0
sitemap found date
2024-04-01 11:43:43
sitemap process date
2024-10-03 06:08:48
sitemap first import date
-
sitemap last import date
-