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 listFeb 20, 2024 10:44Huy Duc LeHuy Duc LeScore: 30,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2024 10:4429,124303,259,486238,812,84202,240,512
2Feb 20, 2024 10:4430,656313,194,796251,376,54402,293,760
3Feb 20, 2024 10:4431,514326,742,053258,416,85602,297,856