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 16, 2024 01:34zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 01:3400000Error: expected "2216120903 ", got "2216120980 "stderr
2Oct 16, 2024 01:3600000Error: Exit with code 1: not a dynamic executable 800000 422905 440674 1968579377 1968579377 5000000 1963579377 1973579377 1963579377 1973579377 50000000 100000000 1963579377 1973579377 49680136 257036stderr
3Oct 16, 2024 01:3700000Error: Exit with code 1: not a dynamic executable 800000 389741 417062 2135033518 2135033518 5000000 2130033518 2140033518 2130033518 2140033518 50000000 100000000 2130033518 2140033518 49548382 337835stderr