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 listJun 21, 2021 15:27Dmitry DolgopolovDmitry DolgopolovScore: 39,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2021 15:3038,363392,504,270314,573,86402,256,896
2Jun 21, 2021 15:3038,411373,948,408314,974,19102,179,072
3Jun 21, 2021 15:3038,616373,232,114316,654,95902,293,760
4Jun 21, 2021 15:3038,745389,269,487317,705,01402,297,856
5Jun 21, 2021 15:3039,104380,210,331320,651,59002,174,976
6Jun 21, 2021 15:2739,111389,964,512320,713,10602,260,992
7Jun 21, 2021 15:3039,133379,717,756320,894,25302,170,880
8Jun 21, 2021 15:2739,166381,762,800321,158,12902,260,992
9Jun 21, 2021 15:2739,815387,773,439326,483,03902,179,072