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 13, 2024 01:56zielajzielajScore: 35,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 01:5634,522307,270,206264,078,00019,005,0002,285,568
2Oct 13, 2024 01:5635,936318,092,240276,694,00017,980,0002,392,064
3Oct 13, 2024 01:5640,691358,177,751311,689,00021,978,0002,502,656