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 22, 2024 22:58Andrey LikhachevAndrey LikhachevScore: 38,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2024 22:5833,120328,139,878271,585,47302,359,296
2Jun 22, 2024 22:5838,943375,585,237319,333,16802,228,224
3Jun 22, 2024 22:5842,797419,014,577350,935,27202,224,128