Currently there is no known implementation of kangaroo algorithm which handles multiple pubkeys. JLPs implementation processes each pubkey consecutively.
BSGS is possible to handle each pubkey simultaneously.
Which one is faster? Depends.
so maybe your meaning is JLP first get one key from file and process only on that until he will find that in collision and than will process second one
and BSGS somewhat i know is checking all same time