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 28, 2024 09:51GabriellaGabriellaScore: 118,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2024 09:51107,540939,852,817881,826,33802,293,760
2Aug 28, 2024 09:51118,5321,047,324,802971,959,88502,301,952
3Aug 28, 2024 09:51124,8211,083,912,5841,023,530,46002,285,568