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 14, 2023 21:12Ulyanov AlekseyUlyanov AlekseyScore: 48,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 21:1247,223452,981,635387,232,37702,297,856
2Jun 14, 2023 21:1248,059452,861,340394,084,39502,179,072
3Jun 14, 2023 21:1248,115452,032,090394,543,47102,179,072