overpass query finding parts of split/divided highways - very slow query at present

divided-highways-overpass.txt

// identify 3-way intersections of identically named ways
// thus to identify/located divided/split roadways

// get nodes of all named ways
way[highway][name]({{bbox}})->.namedways;
// foreach way 
foreach .namedways -> .thisway(
  node(w.thisway)->.childnodes;
  foreach.childnodes -> .thisnode(
  	// select named parent ways of this node with the same name
    way.namedways(bn.thisnode)(if: t["name"] == thisway.u(t["name"]));
    // count how many there are
    if( count(ways) >= 3){
      ( node.thisnode; .result; ) -> .result;
    }; 
  ); // foreach child node
); // foreach named way
.result out skel qt;