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:59Andrey LikhachevAndrey LikhachevScore: 38,578Success
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:5935,778362,950,100293,381,27402,347,008
2Jun 22, 2024 22:5938,578395,190,932316,338,42802,220,032
3Jun 22, 2024 22:5938,750380,404,710317,747,64202,224,128