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 14, 2024 00:21zielajzielajScore: 7,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:216,82479,954,03743,968,00011,991,0002,392,064
2Oct 14, 2024 00:217,19386,849,91445,984,00012,995,0002,367,488
3Oct 14, 2024 00:217,73585,216,46650,339,00013,088,0002,478,080