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 26, 2024 21:38Jonathan Allen GrantJonathan Allen GrantScore: 965,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2024 21:38963,2687,960,929,9287,898,798,24102,297,856
2Jan 26, 2024 21:38965,2227,975,055,0457,914,820,55602,297,856
3Jan 26, 2024 21:38968,1068,001,403,6377,938,469,67402,301,952