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:46Ulyanov AlekseyUlyanov AlekseyScore: 32,189Success
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:4629,355305,271,710240,713,36402,273,280
2Jun 14, 2023 21:4632,189328,366,422263,946,40002,260,992
3Jun 14, 2023 21:4632,309334,435,731264,936,95402,256,896