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 listJul 13, 2023 08:49gchebanovgchebanovScore: 983,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 08:49978,2408,072,263,6438,021,565,68002,285,568
2Jul 13, 2023 08:49983,3388,137,345,3678,063,368,72202,289,664
3Jul 13, 2023 08:49985,5828,137,664,6298,081,774,77402,277,376