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 listFeb 12, 2023 23:05LiamLiamScore: 961,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2023 23:05960,7697,939,145,6727,878,307,63402,289,664
2Feb 12, 2023 23:05961,0417,943,611,9617,880,538,68802,281,472
3Feb 12, 2023 23:05961,9937,952,365,1297,888,343,61002,293,760