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 listJun 12, 2021 21:24Yuriy LyfenkoYuriy LyfenkoScore: 110,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 21:2483,587747,200,442685,415,05902,232,320
2Jun 12, 2021 21:2489,546804,595,053734,276,37702,228,224
3Jun 12, 2021 21:2495,702840,905,382784,752,38502,215,936
4Jun 12, 2021 21:2496,988860,094,462795,301,66802,220,032
5Jun 12, 2021 21:2499,270870,025,981814,011,55202,224,128
6Jun 12, 2021 21:24106,568940,052,140873,859,80302,220,032
7Jun 12, 2021 21:24110,363960,984,902904,973,04402,224,128
8Jun 12, 2021 21:24124,8911,097,088,3891,024,104,17702,211,840
9Jun 12, 2021 21:24140,4181,212,457,3261,151,428,41102,224,128
10Jun 12, 2021 21:24140,4191,211,533,1991,151,434,07102,220,032
11Jun 12, 2021 21:24145,8171,256,865,3981,195,699,73302,211,840
12Jun 12, 2021 21:24167,3061,438,308,0931,371,907,91002,220,032