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 listApr 9, 2025 17:39NoSIMD_C#NoSIMD_C#Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 17:3900000Error: expected "2042977357 ", got "249911697 "
2Apr 9, 2025 17:4000000Error: expected "2038654889 ", got "297303887 "
3Apr 9, 2025 17:4800000Error: expected "2177365737 ", got "160159152 "
4Apr 9, 2025 17:5000000Error: expected "2109850777 ", got "1453153281 "