Let "n" be the total number of digits in the two input numbers in base "D". If the result must be kept in memory then the space complexity is trivially Θ("n"). However, in certain applications, the entire result need not be kept in memory and instead the digits of the result can be streamed out as they are computed (for example, to system console or file). In these scenarios, long multiplication has the advantage that it can easily be formulated as a log space algorithm; that is, an algorithm that only needs working space proportional to the logarithm of the number of digits in the input (Θ(log "n")). This is the "double" logarithm of the numbers being multiplied themselves (log log "N"). Note that operands themselves still need to be kept in memory and their Θ("n") space is not considered in this analysis.