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 listOct 19, 2024 18:17zielajzielajScore: 3,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 18:173,62460,689,12129,713,00002,531,328
2Oct 19, 2024 18:173,67855,135,60728,146,0002,010,0002,387,968
3Oct 19, 2024 18:173,69256,785,87527,247,0003,027,0002,306,048