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 listAug 19, 2026 15:37Victor MerckléVictor MerckléScore: 2,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:382,82531,368,80722,027,0001,140,0002,117,632stderr
2Aug 19, 2026 15:382,85131,569,74422,175,0001,210,0002,117,632stderr
3Aug 19, 2026 15:382,86131,575,72722,265,0001,196,0002,117,632stderr
4Aug 19, 2026 15:382,91832,070,85822,730,0001,203,0002,117,632stderr
5Aug 19, 2026 15:382,97441,439,10923,109,0001,280,0002,117,632stderr
6Aug 19, 2026 15:385,47553,283,62643,873,0001,028,0002,117,632stderr
7Aug 19, 2026 15:385,52353,709,43444,271,0001,018,0002,117,632stderr
8Aug 19, 2026 15:385,55153,707,43544,497,0001,022,0002,117,632stderr
9Aug 19, 2026 15:385,56753,819,29744,628,0001,022,0002,117,632stderr