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 23, 2024 19:27Andrey LikhachevAndrey LikhachevScore: 44,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 19:2744,601424,130,192365,728,61802,289,664
2Jun 23, 2024 19:2744,758433,909,727367,018,07902,211,840
3Jun 23, 2024 19:2745,264436,347,192371,166,49102,207,744