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 listNov 13, 2024 03:17Matt StuchlikMatt StuchlikScore: 26,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 03:1726,228240,537,673173,056,00042,013,0002,465,792
2Nov 13, 2024 03:1726,563244,304,298178,849,00038,967,0002,355,200
3Nov 13, 2024 03:1727,023251,022,141179,668,00041,922,0002,396,160