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 listNov 26, 2024 07:52Matt StuchlikMatt StuchlikScore: 17,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 07:5214,389143,313,703104,992,00012,999,0002,514,944
2Nov 26, 2024 07:5217,046170,015,927122,804,00016,973,0002,322,432
3Nov 26, 2024 07:5218,880179,633,744140,833,00013,983,0002,408,448