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 17, 2023 23:30Ulyanov AlekseyUlyanov AlekseyScore: 31,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2023 23:3031,230322,115,179256,083,10102,244,608
2Jun 17, 2023 23:3031,264320,551,210256,361,83202,248,704
3Jun 17, 2023 23:3031,264316,186,624256,365,29802,248,704