Main

related bits

0

processing priority

4

site type

0 (generic, awaiting analysis)

review version

11

html import

20 (imported)

Events

first seen date

2023-10-09 16:11:55

expired found date

-

created at

2024-06-11 11:24:23

updated at

2026-01-08 01:28:48

Domain name statistics

length

13

crc

29876

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

-

previous id

0

replaced with id

0

related id

-

dns primary id

168829982

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

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

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

6823

mp size raw text

2099

mp inner links count

12

mp inner links status

20 (imported)

Open Graph

title

description

image

site name

author

mishadoff

updated

2025-12-25 12:31:05

raw text

mishadoff thoughts mishadoff thoughts Archive Categories About RSS Mnemonics-based keymap for IntelliJ IDEA Emacs is great for editing text, IntelliJ IDEA is great for navigation. Let’s take best from both worlds into one editor. Read on → Evolville 0.0.2: Life and Death Evolville is an imaginary computer world, inhabited by creatures. They live, move, eat, communicate and evolve. Read on → Evolville 0.0.1: The Beginning Evolville is an imaginary computer world, inhabited by creatures. They live, move, eat, communicate and evolve. This is going to be series of posts for simulation, starting from scratch and test various evolution strategies. Our world will evolve, our creatures will evolve, our code will evolve. Welcome to Evolville! Read on → DFS on Binary Tree Array Implementing Depth-First Search for the Binary Tree without stack and recursion. Read on → Clojure Euler: Problem 026 Find the value of d < 1000 for which 1/d contains the lo...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

230

index version

2025123101

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

1577

text words

316

text unique words

180

text lines

69

text sentences

21

text paragraphs

3

text words per sentence

15

text matched phrases

5

text matched dictionaries

1

RSS

rss status

32 (unknown)

rss found date

2023-12-30 07:24:34

rss size orig

1974197

rss items

67

rss spam phrases

1

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap path

sitemap status

1 (priority 1 already searched, no matches found)

sitemap review version

1

sitemap urls count

0

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

-

sitemap process date

-

sitemap first import date

-

sitemap last import date

-