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 14, 2023 21:13Ulyanov AlekseyUlyanov AlekseyScore: 47,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 21:1546,656438,705,985382,578,33302,179,072
2Jun 14, 2023 21:1346,690459,816,996382,853,91202,306,048
3Jun 14, 2023 21:1547,019448,811,471385,558,56402,179,072
4Jun 14, 2023 21:1547,568463,345,812390,061,43602,297,856
5Jun 14, 2023 21:1347,610450,132,548390,403,79802,179,072
6Jun 14, 2023 21:1347,979464,466,281393,426,84002,293,760