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 listOct 14, 2024 00:43zielajzielajScore: 5,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:435,47670,734,11832,928,00011,973,0002,318,336
2Oct 14, 2024 00:435,65966,216,06636,315,00010,087,0002,465,792
3Oct 14, 2024 00:436,16068,915,60336,370,00014,143,0002,433,024