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 9, 2024 01:12Alexey IlyukhovAlexey IlyukhovScore: 110,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2024 01:12106,414934,696,658872,596,23302,297,856
2Aug 9, 2024 01:12110,879973,314,585909,204,40302,293,760
3Aug 9, 2024 01:12115,7341,009,273,003949,022,10602,289,664