I'm trying to understand Merkle–Damgård construction. We can hash as many blocks of data as we want, if I understand it right. But then it looks like when input is bigger, then also time to compute hash is longer, isn't it?
So is it true that SHA-256 would also calculate the hash longer if input is bigger? Therefore are the hash function efficiency measurements (like 25 cycles per byte), made for some standard input block sizes?