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 27, 2024 20:11emily graceemily graceScore: 115,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 20:1195,567852,780,612783,650,83002,179,072
2Mar 27, 2024 20:11115,4811,006,346,210946,944,53402,256,896
3Mar 27, 2024 20:11122,5921,067,438,5441,005,257,30102,306,048