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 8, 2025 07:19NoSIMD_C#NoSIMD_C#Score: 949,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 07:19948,4207,814,335,4747,589,213,000187,832,0002,281,472
2Apr 8, 2025 07:19949,8337,818,627,1197,595,786,000192,842,0002,281,472
3Apr 8, 2025 07:19953,9907,854,865,1487,620,902,000201,812,0002,281,472