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:06Victor MerckléVictor MerckléScore: 5,491Success
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:072,82131,345,06822,017,0001,118,0002,117,632stderr
2Aug 19, 2026 13:072,84231,511,13722,269,0001,036,0002,117,632stderr
3Aug 19, 2026 13:072,97833,347,15623,230,0001,192,0002,117,632stderr
4Aug 19, 2026 13:075,48353,284,00743,895,0001,069,0002,117,632stderr
5Aug 19, 2026 13:075,49153,165,30443,978,0001,050,0002,117,632stderr
6Aug 19, 2026 13:075,50153,333,65543,964,0001,145,0002,117,632stderr
7Aug 19, 2026 13:075,50353,246,31943,982,0001,147,0002,117,632stderr
8Aug 19, 2026 13:075,52153,494,65744,144,0001,132,0002,117,632stderr
9Aug 19, 2026 13:075,61754,265,55944,914,0001,152,0002,117,632stderr