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 16, 2024 00:01zielajzielajScore: 4,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 00:014,73761,809,71834,859,0003,983,0002,326,528
2Oct 16, 2024 00:014,75859,564,71129,010,00010,003,0002,469,888
3Oct 16, 2024 00:014,77568,109,87332,125,0007,027,0002,297,856
4Oct 16, 2024 00:014,78461,071,42633,196,0006,035,0002,400,256
5Oct 16, 2024 00:014,79266,758,30028,212,00011,083,0002,351,104
6Oct 16, 2024 00:014,83770,834,62030,512,0009,153,0002,342,912
7Oct 16, 2024 00:014,85866,570,78429,876,0009,958,0002,281,472
8Oct 16, 2024 00:014,85971,748,55836,857,0002,988,0002,392,064
9Oct 16, 2024 00:015,00862,446,77332,049,0009,014,0002,535,424