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 listDec 9, 2024 00:31Hayden DonnellyHayden DonnellyScore: 109,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 00:3186,281736,313,104593,586,000113,920,0002,441,216
2Dec 9, 2024 00:31109,996930,412,088783,106,000118,864,0002,461,696
3Dec 9, 2024 00:31117,416985,792,066847,832,000114,977,0002,531,328