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 listAug 28, 2023 23:05Mikhail ShirokovMikhail ShirokovScore: 21,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 23:0521,603231,417,527177,143,65302,306,048
2Aug 28, 2023 23:0521,822246,933,336178,937,48002,265,088
3Aug 28, 2023 23:0521,932241,668,106179,845,95402,256,896