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:00Andrey LikhachevAndrey LikhachevScore: 34,886Success
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:0034,057345,601,881279,270,14202,211,840
2Jun 22, 2024 23:0034,886349,623,721286,066,72002,220,032
3Jun 22, 2024 23:0039,738399,239,339325,850,39802,220,032