Current studies such as Roth (2008) and Rees-Jones (2017) show the advantages and disadvantages of a static DA algorithm used during the college admission process. There has not yet been a study which uses a dynamic version of the DA algorithm to test the efficiency of such algorithm and to test the benefits of the dynamic component of such matching. To shed more light on both, we ran a country wide RCT with information intervention on college applicants on Croatia's centralised and computerised system. This system uses a dynamic DA algorithm where matching between applicants and university programs is done on an hourly basis for a week until the system is closed. Based on hourly rankings for each program applicant update their beliefs about the probability of admission and change their preferences accordingly. Unlike settings in most countries, information about the program cutoffs and points' distribution for previous years is not a public information. Before the start of the experiment we collected baseline information about applicants preferences, priors about program cutoffs and priors about their own success on the state exams. Within the centralised admission system we designed a state of the art software and provided treatments containing program information for past years to test the welfare properties. The unique system allows us to create counterfactuals for every hourly update.