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 15, 2024 23:41zielajzielajScore: 104,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:4191,578773,957,271613,951,000136,989,0002,330,624
2Oct 15, 2024 23:41104,929883,960,939725,511,000134,909,0002,273,280
3Oct 15, 2024 23:41116,979984,841,441831,328,000127,896,0002,351,104