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 listSep 7, 2022 16:38Bernard TeoBernard TeoScore: 997,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2022 16:38997,3088,249,600,6568,177,926,72402,281,472
2Sep 7, 2022 16:38997,5218,238,254,8918,179,672,51102,281,472
3Sep 7, 2022 16:38999,3658,258,222,0888,194,792,36302,289,664