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 11:02NoSIMD_C#NoSIMD_C#Score: 1,627,352Success
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:421,608,84213,230,953,27713,003,624,000188,878,0002,433,024
2Nov 27, 2024 07:421,609,56813,233,981,29513,026,567,000171,888,0002,318,336
3Nov 27, 2024 07:421,614,23513,268,846,26713,040,868,000195,862,0002,269,184
4Nov 27, 2024 11:021,627,35213,379,945,50413,144,432,000199,854,0002,293,760
5Nov 27, 2024 11:021,652,03813,583,029,20213,353,828,000192,881,0002,478,080
6Nov 27, 2024 11:021,661,84413,664,839,64313,429,251,000197,871,0002,400,256