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 listJun 19, 2021 20:08alex3dalex3dScore: 104,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 20:08101,561891,356,880832,799,51502,273,280
2Jun 19, 2021 20:08104,566921,541,332857,444,40002,273,280
3Jun 19, 2021 20:08106,275927,203,902871,452,02502,273,280