Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)We study the discrete time version of the flooding time problem as a model of rumor propagation where each site in the graph has initially a distinct piece of information; we are interested in the number of "conversations" before the entire graph knows all pieces of information. For the complete graph we compare the ratio between the expected propagation time for all pieces of information and the corresponding time for a single piece of information, obtaining the asymptotic ratio 3 / 2 between them.166615581571FAPESP [2013/23081-6]Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)