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:57Andrey LikhachevAndrey LikhachevScore: 36,743Success
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:5735,406346,182,526290,326,61802,220,032
2Jun 22, 2024 22:5636,393364,655,664298,420,90402,220,032
3Jun 22, 2024 22:5636,480364,439,957299,138,39002,211,840
4Jun 22, 2024 22:5736,743366,626,739301,289,71102,224,128
5Jun 22, 2024 22:5736,886365,177,795302,464,46802,220,032
6Jun 22, 2024 22:5639,031410,498,534320,056,52902,236,416