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 19, 2021 10:01Dmitry DolgopolovDmitry DolgopolovScore: 96,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 10:0917,579208,628,868144,151,15702,240,512
2Jun 19, 2021 10:0933,026342,077,434270,816,43002,236,416
3Jun 19, 2021 10:0133,744347,349,522276,702,18302,236,416
4Jun 19, 2021 10:0979,441712,710,658651,418,76502,240,512
5Jun 19, 2021 10:0996,096852,032,676787,987,86902,297,856
6Jun 19, 2021 10:0996,107844,193,396788,077,79302,240,512
7Jun 19, 2021 10:0996,856850,940,725794,219,44402,248,704
8Jun 19, 2021 10:09110,253964,832,090904,078,41902,240,512
9Jun 19, 2021 10:01127,6671,107,930,5531,046,866,45902,240,512
10Jun 19, 2021 10:01161,6581,396,445,6471,325,595,10102,244,608
11Jun 19, 2021 10:09173,4691,473,299,1791,422,448,46102,236,416
12Jun 19, 2021 10:09190,3861,618,901,2911,561,163,49002,232,320