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 30, 2025 06:18NoSIMD_C#NoSIMD_C#Score: 1,863,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 06:181,820,44814,965,057,63414,788,767,000138,903,0002,326,528
2Jan 30, 2025 06:181,863,40115,322,881,51615,165,960,000113,932,0002,330,624
3Jan 30, 2025 06:181,964,44016,147,896,37315,978,499,000129,906,0002,314,240