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 12, 2021 18:15Yuriy LyfenkoYuriy LyfenkoScore: 36,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 18:1532,612333,568,992267,414,54602,289,664
2Jun 12, 2021 18:1632,745322,607,797268,511,53002,293,760
3Jun 12, 2021 18:1633,001324,265,515270,605,40602,285,568
4Jun 12, 2021 18:1636,914372,161,470302,696,63202,285,568
5Jun 12, 2021 18:1542,627421,652,135349,543,84702,285,568
6Jun 12, 2021 18:1542,899411,159,639351,773,93902,297,856