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 17, 2023 23:30Ulyanov AlekseyUlyanov AlekseyScore: 30,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2023 23:3030,400311,106,140249,277,32302,252,800
2Jun 17, 2023 23:3030,430314,566,334249,524,49602,248,704
3Jun 17, 2023 23:3030,453310,648,229249,711,98902,252,800