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 14:03Andrey TsvetkovAndrey TsvetkovScore: 99,472Success
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 14:0494,394836,409,824774,031,06502,277,376
2Jun 20, 2021 14:0499,136887,214,159812,912,78702,273,280
3Jun 20, 2021 14:0399,152874,194,468813,047,47202,289,664
4Jun 20, 2021 14:0399,472874,975,938815,673,70302,273,280
5Jun 20, 2021 14:04103,118905,968,456845,568,75202,203,648
6Jun 20, 2021 14:03106,781959,416,374875,607,47302,277,376