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 27, 2024 23:14emily graceemily graceScore: 106,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 23:1487,894778,721,678720,727,90002,273,280
2Mar 27, 2024 23:14106,682931,804,577874,789,06302,297,856
3Mar 27, 2024 23:14121,2401,059,144,391994,170,51402,293,760