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 listOct 18, 2024 17:46Sybrand AarnoutseSybrand AarnoutseScore: 399,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 17:46188,3311,718,239,8791,010,587,000533,725,0002,478,080
2Oct 18, 2024 17:46399,3324,847,849,4411,547,740,0001,726,784,0002,486,272
3Oct 18, 2024 17:46491,3959,636,187,0271,588,607,0002,440,833,0002,310,144