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 21, 2024 14:05GabriellaGabriellaScore: 167,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 14:05167,0891,440,826,0651,370,129,93002,293,760
2Aug 21, 2024 14:05167,8041,436,828,3261,375,989,71902,293,760
3Aug 21, 2024 14:05168,9431,446,201,7691,385,333,36002,289,664