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 listMar 27, 2024 22:27emily graceemily graceScore: 108,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 22:5373,779671,407,503604,988,95502,301,952
2Mar 27, 2024 22:2777,712696,794,575637,238,54402,174,976
3Mar 27, 2024 22:5380,775732,456,000662,353,08502,306,048
4Mar 27, 2024 23:0284,900760,178,817696,180,69902,174,976
5Mar 27, 2024 23:02108,440950,949,713889,209,88302,174,976
6Mar 27, 2024 22:53109,811980,480,766900,447,88002,293,760
7Mar 27, 2024 23:02111,129978,070,463911,258,97302,293,760
8Mar 27, 2024 22:27121,0491,066,538,813992,603,95002,297,856
9Mar 27, 2024 22:27206,9091,758,381,5821,696,650,61402,183,168