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 12, 2023 14:36Paul MasurelPaul MasurelScore: 16,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 14:3616,428197,162,047134,712,88902,195,456
2Jul 12, 2023 14:3616,529196,672,662135,541,28402,220,032
3Jul 12, 2023 14:3616,622194,799,583136,300,75402,236,416