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 listDec 25, 2024 03:03Joad NacerJoad NacerScore: 3,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 03:033,77554,526,86026,963,0003,994,0002,396,160
2Dec 25, 2024 03:033,80249,586,08929,165,0002,011,0002,486,272
3Dec 25, 2024 03:033,87857,988,76026,828,0004,968,0002,400,256