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 4, 2021 12:51Mikhail ShirokovMikhail ShirokovScore: 21,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2021 12:4821,535249,737,285176,590,62102,265,088
2Aug 4, 2021 12:4821,656252,960,477177,580,69002,260,992
3Aug 4, 2021 12:4821,722236,027,607178,118,15002,260,992
4Aug 4, 2021 12:5121,752268,701,113178,370,44402,269,184
5Aug 4, 2021 12:5121,909248,150,038179,654,74102,301,952
6Aug 4, 2021 12:5122,204245,806,493182,069,80402,260,992