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 16, 2024 01:34zielajzielajScore: 3,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 01:343,67950,900,14228,158,0002,011,0002,527,232
2Oct 16, 2024 01:343,71352,573,00930,448,00002,301,952
3Oct 16, 2024 01:343,71555,579,49228,431,0002,030,0002,297,856