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 00:06cashkarucashkaruScore: 972,328Success
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 00:06971,7778,036,992,1487,968,567,72502,293,760
2Jan 13, 2024 00:06972,3288,035,542,8817,973,085,83502,301,952
3Jan 13, 2024 00:06976,0878,083,201,9068,003,911,93602,301,952