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 listMar 28, 2024 16:38emily graceemily graceScore: 106,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 16:3879,512716,799,645652,001,56602,174,976
2Mar 28, 2024 16:38106,048955,659,565869,596,75902,179,072
3Mar 28, 2024 16:38127,6391,103,304,3731,046,638,92702,306,048