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 listJul 13, 2023 11:09gchebanovgchebanovScore: 43,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 11:0942,290418,924,580346,773,98302,269,184
2Jul 13, 2023 11:0943,758424,583,340358,812,27402,265,088
3Jul 13, 2023 11:0944,071435,163,688361,384,54802,256,896