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 listAug 2, 2022 16:51Robert BurkeRobert BurkeScore: 6,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 16:516,418106,957,08152,626,17502,277,376
2Aug 2, 2022 16:516,439108,477,59752,799,50302,252,800
3Aug 2, 2022 16:516,453118,985,49552,915,69302,203,648