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 23, 2023 21:02Franek KortaFranek KortaScore: 20,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2023 21:0219,602221,892,416160,732,83102,207,744
2Apr 23, 2023 21:0220,543229,876,451168,451,78002,199,552
3Apr 23, 2023 21:0221,438244,070,104175,792,34202,220,032