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 11, 2024 06:02Matt StuchlikMatt StuchlikScore: 10,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 06:028,81593,317,92967,260,0005,019,0002,363,392
2Nov 11, 2024 06:0210,103109,967,01171,867,00010,979,0002,363,392
3Nov 11, 2024 06:0210,122103,506,09077,998,0004,999,0002,502,656
4Nov 11, 2024 06:0210,307116,005,13277,473,0007,043,0002,514,944
5Nov 11, 2024 06:0210,410109,206,33977,325,0008,033,0002,514,944
6Nov 11, 2024 06:0210,515112,935,44776,201,00010,026,0002,498,560
7Nov 11, 2024 06:0211,168118,141,80084,536,0007,044,0002,342,912
8Nov 11, 2024 06:0211,258117,828,30884,288,0008,027,0002,408,448
9Nov 11, 2024 06:0211,503118,621,86384,287,00010,034,0002,465,792