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 listSep 28, 2026 09:19C21C21Score: 14,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 09:2013,170120,612,66987,652,00020,345,0002,117,632
2Sep 28, 2026 09:2014,142126,535,11696,591,00019,375,0002,117,632
3Sep 28, 2026 09:2014,170128,080,11895,337,00020,865,0002,117,632
4Sep 28, 2026 09:2014,289127,718,34497,714,00019,462,0002,117,632
5Sep 28, 2026 09:2014,719131,444,287100,397,00020,306,0002,117,632
6Sep 28, 2026 09:2018,056158,524,249127,594,00020,467,0002,117,632
7Sep 28, 2026 09:2018,097158,997,887126,895,00021,506,0002,117,632
8Sep 28, 2026 09:2019,413169,790,429139,542,00019,646,0002,117,632
9Sep 28, 2026 09:2022,235192,864,472160,594,00021,737,0002,117,632