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 14, 2023 22:11Ulyanov AlekseyUlyanov AlekseyScore: 28,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 22:1128,107289,816,047230,481,28302,273,280
2Jun 14, 2023 22:1128,711314,366,713235,429,80602,265,088
3Jun 14, 2023 22:1131,301323,139,952256,671,54902,265,088