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 listSep 10, 2022 19:10eldon-chungeldon-chungScore: 20,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2022 19:1019,351218,834,452158,680,35002,228,224
2Sep 10, 2022 19:1019,738227,051,248161,851,17302,215,936
3Sep 10, 2022 19:1119,851236,367,268162,778,90302,301,952
4Sep 10, 2022 19:1019,878239,838,759162,997,45502,183,168
5Sep 10, 2022 19:1019,994232,226,540163,954,75102,289,664
6Sep 10, 2022 19:1020,051243,538,142164,416,67302,273,280
7Sep 10, 2022 19:1120,058246,741,100164,473,29402,224,128
8Sep 10, 2022 19:1120,328230,464,369166,685,97702,211,840
9Sep 10, 2022 19:1020,334241,983,976166,738,22302,277,376
10Sep 10, 2022 19:1020,394228,821,511167,231,78102,199,552
11Sep 10, 2022 19:1020,426250,548,181167,489,29602,285,568
12Sep 10, 2022 19:1020,869230,718,195171,124,12902,183,168