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 16, 2023 11:21Ulyanov AlekseyUlyanov AlekseyScore: 109,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2023 11:21109,028959,323,980894,032,70402,260,992
2Jun 16, 2023 11:21109,142956,609,277894,968,11502,269,184
3Jun 16, 2023 11:21109,549963,186,876898,299,51702,273,280