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 17, 2024 00:48zielajzielajScore: 3,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2024 00:483,49257,880,63927,609,0001,022,0002,396,160
2Oct 17, 2024 00:483,49261,091,78927,615,0001,022,0002,420,736
3Oct 17, 2024 00:483,52061,482,80326,870,0001,990,0002,310,144