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 listMar 31, 2024 22:54woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 90,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2024 22:5489,860789,069,001736,850,41902,285,568
2Mar 31, 2024 22:5490,498800,431,200742,087,49702,281,472
3Mar 31, 2024 22:5492,351817,090,026757,280,52202,277,376