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 6, 2024 20:21Mikhail ShirokovMikhail ShirokovScore: 21,748Success
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:2121,471234,210,395176,065,64202,269,184
2Mar 6, 2024 20:2121,748251,381,108178,333,06902,306,048
3Mar 6, 2024 20:2122,261246,623,396182,540,65602,269,184