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:51zielajzielajError
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:5000000Error: expected "2170809889 ", got "2147541023 "stderr
2Oct 19, 2024 17:513,55655,491,16727,147,0002,010,0002,482,176
3Oct 19, 2024 17:513,55653,567,94426,144,0003,016,0002,461,696
4Oct 19, 2024 17:513,60060,900,02726,465,0003,053,0002,306,048