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 listJan 17, 2024 23:02pavelsonkinpavelsonkinScore: 958,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2024 23:02954,4097,895,647,5287,826,155,42302,289,664
2Jan 17, 2024 23:02958,0857,925,628,3437,856,296,71102,281,472
3Jan 17, 2024 23:02958,9477,925,513,1977,863,364,93802,289,664