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 21, 2021 05:53Andrey TsvetkovAndrey TsvetkovScore: 102,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2021 05:5081,150730,671,940665,433,88702,285,568
2Jun 21, 2021 05:5485,737774,003,462703,045,04102,289,664
3Jun 21, 2021 05:5486,720784,730,582711,107,94202,297,856
4Jun 21, 2021 05:50100,273880,464,863822,240,16502,281,472
5Jun 21, 2021 05:53102,660903,958,596841,811,77902,281,472
6Jun 21, 2021 05:54105,026925,897,251861,209,48502,244,608
7Jun 21, 2021 05:50105,346924,533,743863,839,97902,285,568
8Jun 21, 2021 05:53109,580969,803,137898,552,07002,277,376
9Jun 21, 2021 05:53122,5671,066,605,1901,005,046,02702,285,568