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 17:41zielajzielajScore: 3,645Success
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 17:413,43651,043,80526,164,0002,012,0002,494,464
2Oct 19, 2024 17:413,64556,050,09827,897,0001,992,0002,342,912
3Oct 19, 2024 17:413,72152,835,35328,482,0002,034,0002,510,848