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:56zielajzielajScore: 20,346Success
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:5619,682183,718,659145,356,00016,039,0002,461,696
2Oct 13, 2024 01:5619,903185,459,770147,183,00016,020,0002,416,640
3Oct 13, 2024 01:5619,988185,805,963147,913,00015,990,0002,297,856
4Oct 13, 2024 01:5620,113186,893,300148,937,00015,993,0002,449,408
5Oct 13, 2024 01:5620,346196,205,532147,856,00018,981,0002,322,432
6Oct 13, 2024 01:5620,574192,524,764150,740,00017,969,0002,408,448
7Oct 13, 2024 01:5620,591196,877,057152,862,00015,985,0002,461,696
8Oct 13, 2024 01:5621,583200,817,314153,982,00022,997,0002,334,720
9Oct 13, 2024 01:5622,220207,361,476162,178,00020,022,0002,314,240