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 listFeb 10, 2025 07:00NoSIMD_C#NoSIMD_C#Score: 961,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 07:00958,7457,900,906,0347,670,864,000190,847,0002,269,184
2Feb 10, 2025 07:00961,2367,910,521,6667,696,300,000185,838,0002,301,952
3Feb 10, 2025 07:00964,7377,939,813,3377,718,990,000191,850,0002,269,184