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 22:07Ulyanov AlekseyUlyanov AlekseyScore: 28,018Success
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 22:0727,914290,712,629228,894,75702,273,280
2Jun 14, 2023 22:0728,018284,054,172229,751,64202,273,280
3Jun 14, 2023 22:0728,172291,713,285231,007,77602,277,376