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 07:28NoSIMD_C#NoSIMD_C#Score: 183,618Success
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 07:28177,8581,484,814,2871,338,479,000119,953,0002,465,792
2Apr 9, 2025 07:28183,6181,532,302,3121,416,691,00088,980,0002,314,240
3Apr 9, 2025 07:28291,3922,414,552,6802,281,487,000107,928,0002,293,760