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 10, 2023 21:49Martin StensgårdMartin StensgårdScore: 958,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2023 21:49957,4197,913,044,1357,850,836,53002,285,568
2May 10, 2023 21:49958,4917,922,159,8927,859,623,58902,269,184
3May 10, 2023 21:49963,0457,962,006,3027,896,971,02502,289,664