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 1, 2025 17:47spacecat8086spacecat8086Score: 99,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 17:4796,912819,592,186653,733,000140,942,0002,301,952
2Feb 1, 2025 17:4799,027838,877,449674,189,000137,834,0002,502,656
3Feb 1, 2025 17:47121,5421,026,506,282855,836,000140,808,0002,318,336