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 14, 2023 20:58Ulyanov AlekseyUlyanov AlekseyScore: 50,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 20:5349,604467,915,673406,754,34802,281,472
2Jun 14, 2023 20:5849,742470,691,725407,882,28502,281,472
3Jun 14, 2023 20:5350,476498,187,701413,899,67302,289,664
4Jun 14, 2023 20:5850,604480,910,662414,948,85202,289,664
5Jun 14, 2023 20:5350,734469,761,273416,017,77002,285,568
6Jun 14, 2023 20:5850,837470,647,332416,860,14202,297,856