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 12, 2022 01:20Kenneth MaplesKenneth MaplesScore: 31,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2022 01:2028,498300,662,665233,685,03102,281,472
2Oct 12, 2022 01:2031,943331,637,782261,931,53302,281,472
3Oct 12, 2022 01:2037,743364,662,657309,496,12602,281,472