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 3, 2025 05:38NoSIMD_C#NoSIMD_C#Score: 956,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:38952,5807,845,594,9687,613,326,000197,826,0002,269,184
2Feb 3, 2025 05:38954,0367,855,902,4377,630,270,000192,829,0002,269,184
3Feb 3, 2025 05:38955,6637,865,716,2927,646,599,000189,841,0002,269,184
4Feb 3, 2025 05:38956,0007,875,798,1397,652,366,000186,838,0002,285,568
5Feb 3, 2025 05:38956,3187,875,980,2297,649,958,000191,848,0002,461,696
6Feb 3, 2025 05:38956,8397,875,848,4757,655,246,000190,831,0002,269,184
7Feb 3, 2025 05:38957,8957,887,995,0047,650,932,000203,811,0002,269,184
8Feb 3, 2025 05:38959,2037,891,403,4067,672,625,000192,839,0002,465,792
9Feb 3, 2025 05:38963,3327,934,134,0887,714,478,000184,843,0002,396,160