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 29, 2026 13:43Victor MerckléVictor MerckléScore: 5,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:442,72930,690,62021,301,0001,083,0002,117,632stderr
2Aug 29, 2026 13:442,73530,607,30821,289,0001,146,0002,117,632stderr
3Aug 29, 2026 13:442,75330,728,82621,559,0001,018,0002,117,632stderr
4Aug 29, 2026 13:442,76030,970,15021,532,0001,107,0002,117,632stderr
5Aug 29, 2026 13:445,35152,004,34542,845,0001,036,0002,117,632stderr
6Aug 29, 2026 13:445,39452,375,44943,185,0001,053,0002,117,632stderr
7Aug 29, 2026 13:445,39952,404,49243,176,0001,097,0002,117,632stderr
8Aug 29, 2026 13:445,40453,288,07043,181,0001,136,0002,117,632stderr
9Aug 29, 2026 13:445,42653,428,44443,345,0001,151,0002,117,632stderr