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 20, 2021 12:15Andrey TsvetkovAndrey TsvetkovScore: 162,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 12:15100,523879,393,488824,288,91302,195,456
2Jun 20, 2021 12:15162,3733,592,156,9951,331,454,96402,265,088
3Jun 20, 2021 12:15178,6742,608,273,2871,465,124,45602,211,840