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:11zielajzielajScore: 3,762Success
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:113,71451,239,92028,426,0002,030,0002,392,064
2Oct 16, 2024 01:113,71952,418,49128,464,0002,033,0002,457,600
3Oct 16, 2024 01:113,75551,458,14027,814,0002,980,0002,506,752
4Oct 16, 2024 01:113,76156,880,03128,852,0001,989,0002,318,336
5Oct 16, 2024 01:113,76260,301,99422,885,0007,960,0002,531,328
6Oct 16, 2024 01:113,76262,601,40325,871,0004,975,0002,469,888
7Oct 16, 2024 01:113,76361,202,01427,872,0002,986,0002,400,256
8Oct 16, 2024 01:113,76560,634,53127,884,0002,987,0002,523,136
9Oct 16, 2024 01:113,76753,467,40724,909,0005,978,0002,433,024