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 listOct 13, 2021 19:58Sergey StreminSergey StreminScore: 12,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 19:5812,605166,137,152103,360,30402,281,472
2Oct 13, 2021 19:5812,635163,993,809103,606,07702,285,568
3Oct 13, 2021 19:5812,647166,946,356103,705,20902,265,088