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 13, 2024 22:37zielajzielajScore: 5,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 22:375,76666,514,20835,209,00012,071,0002,445,312
2Oct 13, 2024 22:375,89173,115,36238,240,00010,063,0002,478,080
3Oct 13, 2024 22:375,93676,198,71235,495,00013,184,0002,465,792
4Oct 13, 2024 22:375,96073,196,37629,923,00018,951,0002,347,008
5Oct 13, 2024 22:375,99070,845,70434,081,00015,035,0002,514,944
6Oct 13, 2024 22:376,08374,162,76335,917,00013,967,0002,310,144
7Oct 13, 2024 22:376,09772,190,82232,999,00016,999,0002,523,136
8Oct 13, 2024 22:376,14576,861,75936,281,00014,109,0002,424,832
9Oct 13, 2024 22:376,73876,232,54936,163,00019,086,0002,482,176