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:10zielajzielajScore: 3,957Success
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:103,92655,976,11329,173,0003,017,0002,285,568
2Oct 16, 2024 01:103,95252,050,42531,398,0001,012,0002,330,624
3Oct 16, 2024 01:103,95359,456,92629,377,0003,039,0002,379,776
4Oct 16, 2024 01:103,95559,935,64629,395,0003,040,0002,490,368
5Oct 16, 2024 01:103,95752,064,97529,406,0003,042,0002,301,952
6Oct 16, 2024 01:103,96861,220,00728,474,0004,067,0002,478,080
7Oct 16, 2024 01:103,97160,960,89830,529,0002,035,0002,379,776
8Oct 16, 2024 01:103,97762,962,18726,500,0006,115,0002,347,008
9Oct 16, 2024 01:104,01953,187,53330,955,0001,997,0002,510,848