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 20, 2024 21:25Jatin YadavJatin YadavScore: 127,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2024 21:25124,3651,089,044,7091,019,788,95302,293,760
2Aug 20, 2024 21:25127,2531,111,399,1721,043,477,96602,297,856
3Aug 20, 2024 21:25140,3141,201,710,0651,150,572,24502,293,760