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:25NoSIMD_C#NoSIMD_C#Score: 311,760Success
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:25285,0592,367,500,4312,228,556,000108,929,0002,473,984
2Apr 4, 2025 14:25311,7602,586,434,6912,440,503,000115,928,0002,293,760
3Apr 4, 2025 14:25340,8412,818,549,1652,677,987,000116,912,0002,457,600