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 listAug 31, 2026 15:34Victor MerckléVictor MerckléScore: 2,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 15:352,74431,468,28221,471,0001,031,0002,117,632stderr
2Aug 31, 2026 15:352,75930,807,16021,544,0001,081,0002,117,632stderr
3Aug 31, 2026 15:352,87740,525,55222,552,0001,040,0002,117,632stderr
4Aug 31, 2026 15:352,87840,764,91522,570,0001,030,0002,117,632stderr
5Aug 31, 2026 15:352,88941,295,08822,598,0001,093,0002,117,632stderr
6Aug 31, 2026 15:352,93241,508,20522,898,0001,145,0002,117,632stderr
7Aug 31, 2026 15:352,95940,171,25823,133,0001,136,0002,117,632stderr
8Aug 31, 2026 15:355,43252,903,50443,529,0001,018,0002,117,632stderr
9Aug 31, 2026 15:355,67661,952,64345,532,0001,015,0002,117,632stderr