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, 2026 18:15Pavel SkripkinPavel SkripkinError
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, 2026 18:150112,676,99797,287,0001,015,0002,408,448expected "2092908485 ", got "2143773103 "stderr
2May 7, 2026 18:1511,930110,920,08196,816,0001,013,0002,404,352stderr
3May 7, 2026 18:1512,029112,894,21797,627,0001,014,0002,408,448stderr