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 27, 2024 08:53NoSIMD_C#NoSIMD_C#Score: 1,626,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 08:531,612,77213,255,548,35813,035,852,000188,881,0002,338,816
2Nov 27, 2024 08:531,626,88613,375,414,72713,151,585,000188,879,0002,416,640
3Nov 27, 2024 08:531,638,12613,462,574,76613,247,750,000184,884,0002,412,544