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 listFeb 20, 2024 10:34Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2024 10:3400000Error: No answer to stdout. Died or killed?stderr
2Feb 20, 2024 10:3436,436365,370,093298,772,19302,224,128
3Feb 20, 2024 10:3436,520361,398,793299,467,73602,285,568
4Feb 20, 2024 10:3437,443369,658,809307,034,26602,220,032