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 15, 2024 00:07zielajzielajScore: 5,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 00:074,73769,657,56032,867,0005,975,0002,379,776
2Oct 15, 2024 00:075,01262,216,26431,073,00010,023,0002,301,952
3Oct 15, 2024 00:075,04163,058,38728,229,00013,106,0002,428,928