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:51Andrey LikhachevAndrey LikhachevScore: 40,126Success
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:5139,741400,314,408325,879,25002,215,936
2Jun 22, 2024 22:5140,126397,769,944329,033,77802,215,936
3Jun 22, 2024 22:5142,208405,180,234346,105,50202,220,032