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:50NoSIMD_C#NoSIMD_C#Score: 1,612,701Success
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:501,603,89613,183,158,59912,973,056,000178,890,0002,490,368
2Nov 27, 2024 08:501,612,70113,253,675,96913,019,271,000204,878,0002,531,328
3Nov 27, 2024 08:501,628,41013,384,825,33313,146,105,000206,860,0002,281,472