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 listJan 19, 2025 00:59Ian MckibbenIan MckibbenScore: 19,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 00:5919,277178,905,224157,075,0001,000,0002,433,024
2Jan 19, 2025 00:5919,285185,671,608157,139,0001,000,0002,441,216
3Jan 19, 2025 00:5919,328183,309,589155,482,0003,009,0002,437,120
4Jan 19, 2025 00:5919,364181,909,678157,790,000998,0002,396,160
5Jan 19, 2025 00:5919,369180,457,107156,825,0001,997,0002,424,832
6Jan 19, 2025 00:5919,415181,336,729157,202,0002,002,0002,433,024