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 00:16apuxbtapuxbtScore: 1,027,626Success
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 00:16994,2138,217,844,3928,152,547,80102,265,088
2Sep 28, 2023 00:161,027,6268,483,077,2428,426,531,30402,265,088
3Sep 28, 2023 00:161,028,8658,509,153,7468,436,689,31002,265,088