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:00NoSIMD_C#NoSIMD_C#Score: 1,653,617Success
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:001,634,93013,444,731,60513,251,525,000154,900,0002,338,816
2Nov 28, 2024 16:001,653,61713,593,826,53613,377,770,000181,888,0002,338,816
3Nov 28, 2024 16:001,655,84013,614,978,75313,394,012,000183,876,0002,265,088