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 07:30NoSIMD_C#NoSIMD_C#Score: 1,809,408Success
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 07:301,777,94714,614,772,40214,381,286,000197,880,0002,412,544
2Nov 27, 2024 07:301,809,40814,872,662,11314,625,276,000211,873,0002,428,928
3Nov 27, 2024 07:301,839,47915,120,127,95014,893,858,000189,870,0002,400,256