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 14:01GabriellaGabriellaScore: 167,777Success
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 14:01167,1741,438,408,8611,370,823,49602,293,760
2Aug 21, 2024 14:01167,7771,443,945,1661,375,770,76402,301,952
3Aug 21, 2024 14:01168,8651,447,059,1541,384,692,27002,289,664