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:14Victor MerckléVictor MerckléScore: 5,378Success
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:152,72830,466,92721,282,0001,088,0002,117,632stderr
2Aug 29, 2026 13:152,73930,810,25721,441,0001,023,0002,117,632stderr
3Aug 29, 2026 13:152,74330,598,80721,479,0001,017,0002,117,632stderr
4Aug 29, 2026 13:152,81631,197,75621,909,0001,188,0002,117,632stderr
5Aug 29, 2026 13:155,37852,448,62643,056,0001,047,0002,117,632stderr
6Aug 29, 2026 13:155,37952,282,65543,062,0001,046,0002,117,632stderr
7Aug 29, 2026 13:155,38452,441,13543,112,0001,038,0002,117,632stderr
8Aug 29, 2026 13:155,40353,323,68343,176,0001,134,0002,117,632stderr
9Aug 29, 2026 13:155,42253,459,59243,345,0001,122,0002,117,632stderr