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: 958,013Success
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:38951,9337,864,836,9347,805,848,05602,301,952
2Jan 26, 2024 21:38958,0137,929,191,3277,855,702,60702,293,760
3Jan 26, 2024 21:38965,1257,985,151,9557,914,027,56902,306,048