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 30, 2024 19:00Joad NacerJoad NacerScore: 9,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2024 19:009,088141,476,52374,524,34902,260,992
2May 30, 2024 19:009,210137,249,01775,520,10502,256,896
3May 30, 2024 19:009,454136,798,19177,526,71102,252,800