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 listSep 28, 2023 13:46apuxbtapuxbtScore: 124,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 13:46105,639917,979,112866,236,75602,256,896
2Sep 28, 2023 13:46124,5771,090,506,3411,021,529,92702,256,896
3Sep 28, 2023 13:46130,0051,127,258,4081,066,043,72402,269,184