Dgraph slows down progressively

Users Dgraph
2

I added around 100k edges and I tried removing and adding 1700 edges on a predicate with @reverse and @count indexes.
It’s taking around 14sec. Could you try running this at your end and let me know how much time it takes?

func TestCountIndexThroughput(t *testing.T) {
	total := 100000
	numUIDs := uint64(total)

	dg, err := testutil.DgraphClientWithGroot(testutil.SockAddr)
	if err != nil {
		t.Fatalf("Error while getting a dgraph client: %v", err)
	}

	if err := testutil.AssignUids(uint64(total * 10)); err != nil {
		t.Fatalf("error in assigning UIDs :: %v", err)
	}

	rdfs := make([]string, 0)
	for uid := 1; uid < int(numUIDs); uid++ {
		rdf := fmt.Sprintf("<%v> <friend> <%v> .\n", uid, uid+1)
		if err := testutil.RetryMutation(dg, &api.Mutation{
			CommitNow: false,
			SetNquads: []byte(rdf),
		}); err != nil {
			t.Fatalf("error in mutation :: %v", err)
		}
		rdfs = append(rdfs, rdf)
	}

	start := time.Now()
	for idx, rdf := range rdfs {
		if err := testutil.RetryMutation(dg, &api.Mutation{
			CommitNow: false,
			DelNquads: []byte(rdf),
		}); err != nil {
			t.Fatalf("error in mutation :: %v", err)
		}
		if idx > 1700 {
			break
		}
	}

	for idx, rdf := range rdfs {
		if err := testutil.RetryMutation(dg, &api.Mutation{
			CommitNow: false,
			SetNquads: []byte(rdf),
		}); err != nil {
			t.Fatalf("error in mutation :: %v", err)
		}
		if idx > 1700 {
			break
		}
	}
	elapsed := time.Since(start)
	log.Printf("Time: %s", elapsed)
}