Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listSep 8, 2026 11:53Victor MerckléVictor MerckléScore: 2,637Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 11:542,55629,180,81720,967,000024,576stderr
2Sep 8, 2026 11:542,55729,161,05220,975,000024,576stderr
3Sep 8, 2026 11:542,58729,583,89121,221,000024,576stderr
4Sep 8, 2026 11:542,59829,791,40021,306,000024,576stderr
5Sep 8, 2026 11:542,63729,803,83621,625,000024,576stderr
6Sep 8, 2026 11:542,64329,948,39021,674,000024,576stderr
7Sep 8, 2026 11:545,38552,400,60843,150,0001,014,00024,576stderr
8Sep 8, 2026 11:545,41352,804,40643,372,0001,016,00024,576stderr
9Sep 8, 2026 11:5411,636103,629,37694,409,0001,007,00024,576stderr