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 19, 2024 18:22zielajzielajScore: 3,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 18:223,49855,307,63026,635,0002,048,0002,478,080
2Oct 19, 2024 18:223,51755,998,42825,859,0002,983,0002,465,792
3Oct 19, 2024 18:223,51752,079,65325,860,0002,983,0002,293,760