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 23:45zielajzielajError
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 23:4400000Error: Exit with code 1: not a dynamic executable 0 4294967295 50000000 100000000 2004318071 2290649223 50131652 6364556stderr
2Oct 14, 2024 23:455,01866,011,16132,113,0009,031,0002,535,424
3Oct 14, 2024 23:455,22269,672,29929,876,00012,946,0002,408,448
4Oct 14, 2024 23:455,49565,107,67031,043,00014,019,0002,531,328