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 listJul 16, 2023 22:20Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 22:2400000Error: No answer to stdout. Died or killed?stderr
2Jul 16, 2023 22:204,984602,216,10240,871,97002,260,992
3Jul 16, 2023 22:205,178596,115,50442,463,34102,207,744
4Jul 16, 2023 22:205,183607,406,68542,498,77102,224,128