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 listMay 22, 2023 09:21Franek KortaFranek KortaScore: 16,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2023 09:2113,957175,280,486114,446,15102,281,472
2May 22, 2023 09:2116,389190,607,743134,392,31402,195,456
3May 22, 2023 09:2117,015206,167,013139,526,85202,199,552