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 listSep 10, 2024 05:40Andrey LikhachevAndrey LikhachevScore: 11,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2024 05:4011,095118,556,49689,976,000999,0002,490,368
2Sep 10, 2024 05:4011,148118,853,07490,412,0001,004,0002,457,600
3Sep 10, 2024 05:4011,166120,143,26090,556,0001,006,0002,449,408