Find the computational complexity of a concatenated system
To summarize what you're saying:


You have an algorithm that runs in $O(n)$.
You're running it on $L$ different blocks, sequentially (no parallelism).
Every block has size $N$.


In this case, the total running time is indeed $O(LN)$.