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 13, 2024 15:48zielajzielajScore: 14,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 15:4814,564148,888,750107,379,00012,042,0002,498,560
2Oct 13, 2024 15:4814,669146,942,80399,233,00021,049,0002,322,432
3Oct 13, 2024 15:4814,707145,802,658107,530,00013,064,0002,506,752