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 listAug 20, 2024 22:34Jatin YadavJatin YadavScore: 66,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2024 22:3463,761587,668,962522,841,86002,277,376
2Aug 20, 2024 22:3466,085601,062,596541,900,84402,277,376
3Aug 20, 2024 22:3477,123717,806,027632,406,89002,277,376