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 15, 2023 08:36Martin StensgårdMartin StensgårdScore: 68,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2023 08:3668,118628,278,303558,568,59602,215,936
2May 15, 2023 08:3668,265618,424,350559,769,11702,224,128
3May 15, 2023 08:3669,838647,204,718572,673,43802,215,936