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 21:08Yuriy LyfenkoYuriy LyfenkoScore: 103,327Success
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 21:08102,902917,111,510843,797,54902,224,128
2Jun 12, 2021 21:08103,327904,424,036847,282,17502,215,936
3Jun 12, 2021 21:08142,7281,225,258,5221,170,370,84902,220,032