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 listApr 25, 2023 19:38Franek KortaFranek KortaScore: 12,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2023 19:3811,942154,056,93197,926,98102,183,168
2Apr 25, 2023 19:5012,411161,263,638101,767,18202,199,552
3Apr 25, 2023 19:5012,444154,390,994102,043,59802,195,456
4Apr 25, 2023 19:3812,477159,717,295102,311,77402,260,992
5Apr 25, 2023 19:3813,146166,930,676107,795,57602,301,952
6Apr 25, 2023 19:5014,176185,835,142116,239,18402,174,976