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 27, 2021 18:44gchebanovgchebanovScore: 32,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 18:4432,098328,127,287263,203,22702,236,416
2Jun 27, 2021 18:4432,587324,696,047267,216,95702,232,320
3Jun 27, 2021 18:4432,810336,486,436269,041,96602,240,512