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 listApr 25, 2023 19:02Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2023 19:0200000Error: No answer to stdout. Died or killed?stderr
2Apr 25, 2023 19:0410,049132,542,25882,398,26702,277,376
3Apr 25, 2023 19:0410,831148,301,37188,810,59102,297,856
4Apr 25, 2023 19:0210,966149,147,52989,924,81402,232,320
5Apr 25, 2023 19:0211,525166,109,09294,503,98802,248,704
6Apr 25, 2023 19:0412,005164,656,55798,439,89802,215,936
7Apr 25, 2023 19:0212,012154,504,73198,502,32802,211,840