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 listMar 30, 2024 10:27woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 88,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2024 10:2783,369743,174,465683,629,13702,269,184
2Mar 30, 2024 10:2788,007791,540,655721,655,36502,281,472
3Mar 30, 2024 10:27109,322965,665,753896,441,35902,289,664