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 4, 2025 14:39NoSIMD_C#NoSIMD_C#Score: 331,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 14:39282,5122,340,281,2212,136,705,000179,891,0002,478,080
2Apr 4, 2025 14:39331,2872,751,013,7992,540,710,000175,841,0002,404,352
3Apr 4, 2025 14:39374,1673,096,929,0052,896,276,000171,897,0002,273,280