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 21, 2025 07:39NoSIMD_C#NoSIMD_C#Score: 1,717,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 07:391,695,87913,945,236,16613,685,364,000220,844,0002,347,008
2Jan 21, 2025 07:391,717,41914,222,963,97113,905,089,000177,745,0002,416,640
3Jan 21, 2025 07:391,748,55214,375,491,52514,153,242,000184,885,0002,371,584