Implement an algorithm to merge an arbitrary number of sorted lists into one sorted list. The aim is to create the smallest working programme, in whatever language you like.
F#, 32 chars
let f x=List.sort(List.concat x)
And without using a built in function for the concat (57 chars):
let f x=List.sort(Seq.toList(seq{for l in x do yield!l}))