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 15, 2023 22:08Franek KortaFranek KortaScore: 49,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2023 22:0845,954434,664,864376,822,93002,293,760
2Apr 15, 2023 22:0849,306475,857,250404,308,94802,256,896
3Apr 15, 2023 22:0850,661479,399,667415,419,07102,207,744