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 18, 2024 17:36Sybrand AarnoutseSybrand AarnoutseScore: 370,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 17:36260,8182,840,289,5681,056,493,0001,082,213,0002,510,848
2Oct 18, 2024 17:36370,7016,193,184,6231,295,101,0001,744,649,0002,379,776
3Oct 18, 2024 17:36530,78711,759,735,0771,681,349,0002,671,102,0002,437,120