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 listJun 9, 2024 18:26Mikhail ShirokovMikhail ShirokovScore: 21,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 20:1721,552235,107,773176,724,11202,273,280
2Mar 6, 2024 20:1721,580253,549,310176,958,57002,269,184
3Jun 9, 2024 18:2621,588236,906,334177,020,72802,265,088
4Mar 6, 2024 20:1721,609232,675,430177,197,70902,273,280
5Jun 9, 2024 18:2621,711236,523,838178,029,20702,256,896
6Jun 9, 2024 18:2621,904246,326,905179,611,16702,260,992