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 listNov 11, 2021 08:18Ilya AniskovetsIlya AniskovetsScore: 21,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2021 08:1820,934247,735,956171,657,30402,260,992
2Nov 11, 2021 08:1821,786244,731,144178,644,51102,273,280
3Nov 11, 2021 08:1821,924238,244,802179,773,09402,277,376