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 listAug 28, 2023 23:46Mikhail ShirokovMikhail ShirokovScore: 21,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 23:4621,986238,573,099180,281,20302,265,088
2Aug 28, 2023 23:4621,997253,372,429180,372,11502,277,376
3Aug 28, 2023 23:4622,406267,679,401183,728,25602,179,072