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 13:24Victor MerckléVictor MerckléScore: 2,996Success
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 13:292,88532,078,20222,603,0001,061,0002,117,632stderr
2Aug 19, 2026 13:292,89532,548,93622,679,0001,065,0002,117,632stderr
3Aug 19, 2026 13:292,91132,164,82322,842,0001,036,0002,117,632stderr
4Aug 19, 2026 13:292,99333,482,90323,499,0001,048,0002,117,632stderr
5Aug 19, 2026 13:292,99633,550,16123,522,0001,048,0002,117,632stderr
6Aug 19, 2026 13:2911,715104,354,53695,056,0001,010,0002,117,632stderr
7Aug 19, 2026 13:2911,787105,019,71395,647,0001,010,0002,117,632stderr
8Aug 19, 2026 13:2911,856105,498,25896,212,0001,012,0002,117,632stderr
9Aug 19, 2026 13:2912,454110,458,830101,121,0001,009,0002,117,632stderr