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 15, 2025 23:25Ian MckibbenIan MckibbenScore: 13,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 23:2513,386132,949,145107,767,0001,995,0002,277,376
2Jan 15, 2025 23:2513,412137,683,314107,982,0001,999,0002,445,312
3Jan 15, 2025 23:2513,421133,977,235108,054,0002,001,0002,420,736