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 3, 2022 13:06Robert BurkeRobert BurkeScore: 4,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 13:064,62792,994,57837,941,88402,215,936
2Aug 3, 2022 13:064,63298,165,84737,986,13602,285,568
3Aug 3, 2022 13:064,662116,164,80938,229,65802,224,128