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 21, 2024 13:39GabriellaGabriellaScore: 955,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 13:39952,7827,867,573,0517,812,811,05702,301,952
2Aug 21, 2024 13:39955,0087,893,278,3387,831,062,21402,277,376
3Aug 21, 2024 13:39957,4827,910,698,6497,851,348,77602,293,760