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 listJul 31, 2021 22:55Mikhail ShirokovMikhail ShirokovScore: 151,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2021 22:55137,1021,199,338,4161,124,234,00202,318,336
2Jul 31, 2021 22:55151,7751,306,152,9061,244,552,48102,244,608
3Jul 31, 2021 22:55166,9051,433,337,5421,368,624,64602,314,240