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 16, 2023 23:30Yuriy LyfenkoYuriy LyfenkoScore: 7,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 23:307,878633,213,10364,601,37602,203,648
2Jul 16, 2023 23:307,885625,384,52664,654,00202,215,936
3Jul 16, 2023 23:307,917622,746,80764,918,96102,285,568