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:40Andrey LikhachevAndrey LikhachevScore: 40,353Success
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:4039,203393,359,958321,463,69902,220,032
2Jun 22, 2024 22:4040,353407,762,470330,898,19702,215,936
3Jun 22, 2024 22:4040,377390,754,844331,089,96302,203,648