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 21, 2024 10:10Huy Duc LeHuy Duc LeScore: 14,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 10:1013,794169,262,119113,113,39402,224,128
2Feb 21, 2024 10:1014,088180,201,341115,524,72002,179,072
3Feb 21, 2024 10:1014,209181,677,744116,510,29202,277,376