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 listJun 15, 2021 19:16Sergey StreminSergey StreminScore: 23,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2021 19:1623,702252,557,914194,360,16502,281,472
2Jun 15, 2021 19:1623,743262,990,641194,691,44402,297,856
3Jun 15, 2021 19:1624,246269,927,841198,815,21102,301,952