In a branching process, the number of particles increasesexponentially with time, which makes numerical simulations for large timesdifficult. In many applications, however, only the region close to the extremalparticles is relevant (the “tip”). We present a simple algorithmwhich allows to simulate a branching random walk in one dimension, keepingonly the particles that arrive within some distance of the rightmost particle ata predefined time T. The complexity of the algorithm growslinearly with T. We can furthermore choose to require that therealizations have their rightmost particle arbitrarily far on the right from itstypical position. We illustrate our algorithm by evaluating an observable forwhich no other practical method is known.