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 23:03Andrey LikhachevAndrey LikhachevScore: 42,009Success
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 23:0339,348398,005,407322,650,77002,215,936
2Jun 22, 2024 23:0342,009413,019,337344,470,86102,228,224
3Jun 22, 2024 23:0343,592423,875,680357,451,74802,224,128