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 listNov 28, 2024 16:12NoSIMD_C#NoSIMD_C#Score: 1,976,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 16:121,893,49115,556,303,26015,405,703,000120,927,0002,326,528
2Nov 28, 2024 16:121,976,33016,242,342,23516,096,973,000108,932,0002,326,528
3Nov 28, 2024 16:121,987,01216,332,293,88316,165,564,000127,933,0002,359,296