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 20:49Ulyanov AlekseyUlyanov AlekseyScore: 58,126Success
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 20:4958,058540,982,634476,074,28202,281,472
2Jun 14, 2023 20:4958,126546,066,828476,630,34202,289,664
3Jun 14, 2023 20:4958,477546,379,848479,513,50702,289,664