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 listAug 7, 2022 11:13Franek KortaFranek KortaScore: 1,003,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2022 11:13992,2808,198,051,3258,136,697,62802,289,664
2Aug 7, 2022 11:141,000,3018,280,995,6558,202,470,07802,289,664
3Aug 7, 2022 11:141,000,9438,267,465,3978,207,729,15502,297,856
4Aug 7, 2022 11:131,003,9768,297,958,0378,232,602,91802,289,664
5Aug 7, 2022 11:141,004,8578,306,798,9318,239,824,26902,285,568
6Aug 7, 2022 11:131,005,5988,306,450,7928,245,904,94402,297,856