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:19Franek KortaFranek KortaScore: 17,612Success
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:1915,901202,021,316130,387,59602,281,472
2May 22, 2023 09:1917,612195,087,901144,420,49702,277,376
3May 22, 2023 09:1919,001211,939,977155,808,00202,220,032