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:15GabriellaGabriellaScore: 167,747Success
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:15167,0841,429,509,4571,370,091,50002,289,664
2Aug 21, 2024 14:15167,7471,450,447,6171,375,521,91402,281,472
3Aug 21, 2024 14:15168,9171,441,521,1281,385,119,31102,297,856