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 listJul 15, 2023 06:48Paul MasurelPaul MasurelScore: 20,165Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 06:4820,020230,226,657164,167,91502,220,032
2Jul 15, 2023 06:4820,165232,812,355165,351,23102,232,320
3Jul 15, 2023 06:4820,170237,004,033165,393,67302,265,088