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 17, 2024 00:29zielajzielajScore: 3,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2024 00:293,47149,211,58527,450,0001,016,0002,375,680
2Oct 17, 2024 00:293,49156,750,17627,608,0001,022,0002,310,144
3Oct 17, 2024 00:293,52254,062,14328,877,00002,347,008