The left panel is a process heap after constructing an Order object graph. The Order points to a Customer, which points to an Address, which points to a TaxRegion, which points to a RateTable. The LineItem array hangs off the Order separately. Six objects, six heap allocations, scattered across the address space by the allocator. To compute the order total, the CPU must chase five pointers. Each pointer chase is a place where the CPU may have to wait for memory, and how long it waits depends on the machine and on what the cache happens to hold.
The right panel is the same data as three flat arrays: one for customers, one for orders and one for line items. Three allocations. Each array is contiguous in memory, and a field is found by its position, so there are no pointer chases. This is the layout the book recommends in place of an object graph. A typed array, a struct or a record fits the picture exactly. A plain Python list or dict still keeps its values as separate objects, so for those the picture is a close sketch.
The class version needs six allocations and five pointer chases to reach its data. The flat version needs three allocations and none. The demo counts those facts, and it makes no claim about how many nanoseconds they cost on your machine.