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:59zielajzielajScore: 17,051Success
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:5916,599166,782,989119,097,00017,013,0002,527,232
2Oct 13, 2024 01:5916,607160,217,739126,166,00010,013,0002,383,872
3Oct 13, 2024 01:5916,824163,206,686118,960,00018,993,0002,416,640
4Oct 13, 2024 01:5916,937166,865,641120,900,00017,985,0002,355,200
5Oct 13, 2024 01:5917,051165,255,924124,839,00014,980,0002,506,752
6Oct 13, 2024 01:5917,114165,080,079122,295,00018,043,0002,355,200
7Oct 13, 2024 01:5917,195165,301,013119,997,00020,999,0002,371,584
8Oct 13, 2024 01:5917,237167,929,222113,275,00028,068,0002,281,472
9Oct 13, 2024 01:5917,274172,802,194121,696,00019,950,0002,506,752