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 4, 2023 20:55Franek KortaFranek KortaScore: 16,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2023 20:5515,792201,407,230129,496,86102,248,704
2Jun 4, 2023 20:5516,072188,403,026131,789,54102,179,072
3Jun 4, 2023 20:5517,209197,196,181141,111,85102,236,416