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 01:52zielajzielajScore: 37,391Success
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 01:5234,691313,671,389269,442,00015,024,0002,277,376
2Oct 13, 2024 01:5234,910309,927,442266,247,00020,018,0002,359,296
3Oct 13, 2024 01:5235,866316,456,301272,096,00022,007,0002,330,624
4Oct 13, 2024 01:5236,384329,458,952275,322,00023,027,0002,527,232
5Oct 13, 2024 01:5237,391337,422,819283,636,00022,970,0002,453,504
6Oct 13, 2024 01:5238,645338,744,428288,902,00027,990,0002,330,624
7Oct 13, 2024 01:5238,738345,762,457296,672,00020,976,0002,453,504
8Oct 13, 2024 01:5239,951353,653,531304,628,00022,971,0002,306,048
9Oct 13, 2024 01:5240,710364,502,924310,833,00022,987,0002,502,656