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 listMay 7, 2025 08:36KeefeKeefeScore: 13,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 08:3613,527139,480,749108,927,0001,998,0002,400,256
2May 7, 2025 08:3613,532135,828,456108,961,0001,999,0002,265,088
3May 7, 2025 08:3613,625136,196,383110,732,000997,0002,289,664