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 listMay 15, 2023 08:11Martin StensgårdMartin StensgårdScore: 72,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2023 08:1171,746654,567,580588,318,77202,215,936
2May 15, 2023 08:1172,942655,455,214598,126,59102,211,840
3May 15, 2023 08:1174,235679,955,591608,730,09302,211,840