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:37Jonathan Allen GrantJonathan Allen GrantScore: 980,381Success
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:37978,2198,102,182,2228,021,399,76702,293,760
2Jan 26, 2024 21:37980,3818,099,817,5388,039,126,90302,297,856
3Jan 26, 2024 21:37982,1358,116,930,4388,053,509,71502,301,952