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 16:54NoSIMD_C#NoSIMD_C#Score: 252,348Success
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 16:54245,5502,041,952,4881,906,592,000106,921,0002,392,064
2Apr 4, 2025 16:54252,3482,101,266,2281,963,291,000105,961,0002,445,312
3Apr 4, 2025 16:54386,3323,196,785,0973,041,006,000126,916,0002,314,240