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 listJun 21, 2024 23:05Andrey LikhachevAndrey LikhachevScore: 51,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2024 23:0551,802484,768,428424,777,07602,232,320
2Jun 21, 2024 23:0551,949483,558,101425,978,39502,244,608
3Jun 21, 2024 23:0555,034514,894,805451,274,84802,240,512