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:29NoSIMD_C#NoSIMD_C#Score: 358,014Success
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:23217,5681,808,642,0251,658,121,000125,933,0002,404,352
2Apr 4, 2025 14:23227,2621,897,335,7071,732,653,000130,898,0002,514,944
3Apr 4, 2025 14:29248,7382,065,210,5871,927,724,000111,925,0002,277,376
4Apr 4, 2025 14:23358,0142,969,472,9742,814,806,000120,905,0002,269,184
5Apr 4, 2025 14:29375,3663,115,604,4942,962,079,000115,924,0002,330,624
6Apr 4, 2025 14:29424,3113,512,261,3993,364,402,000114,945,0002,469,888