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 listOct 13, 2024 00:19zielajzielajScore: 94,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 00:1983,712715,344,072671,451,00014,987,0002,514,944
2Oct 13, 2024 00:1988,982755,679,954718,655,00010,994,0002,310,144
3Oct 13, 2024 00:1990,523765,570,922727,304,00014,985,0002,498,560
4Oct 13, 2024 00:1991,518780,630,396733,464,00016,987,0002,347,008
5Oct 13, 2024 00:1994,460797,544,377758,584,00015,991,0002,322,432
6Oct 13, 2024 00:1994,962801,974,337761,699,00016,993,0002,424,832
7Oct 13, 2024 00:19102,337870,673,657819,185,00019,980,0002,490,368
8Oct 13, 2024 00:19102,396868,176,006824,655,00014,993,0002,347,008
9Oct 13, 2024 00:19111,525936,605,186899,514,00014,991,0002,465,792