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 listJan 13, 2024 02:28cashkarucashkaruScore: 104,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2024 02:28102,125896,300,928837,428,94502,179,072
2Jan 13, 2024 02:28104,230916,681,335854,687,24802,301,952
3Jan 13, 2024 02:28104,276915,924,432855,061,58902,301,952