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 listSep 30, 2023 18:47apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2023 18:4600000Error: Exit with code 255: stage0, total(ms):1 stage1, total(ms):116 clt = 52943385stderr
2Sep 30, 2023 18:4600000Error: Exit with code 255: stage0, total(ms):1 stage1, total(ms):118 clt = 50004722stderr
3Sep 30, 2023 18:4717,106201,980,232140,271,20702,228,224
4Sep 30, 2023 18:4717,652209,749,399144,748,20702,236,416
5Sep 30, 2023 18:4717,782218,903,891145,812,49102,236,416