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 23, 2026 16:54Victor MerckléVictor MerckléScore: 2,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:562,74930,876,34522,548,00002,129,920stderr
2Aug 23, 2026 16:562,76431,035,35521,662,0001,010,0002,129,920stderr
3Aug 23, 2026 16:562,77331,046,24221,713,0001,027,0002,129,920stderr
4Aug 23, 2026 16:562,77631,082,67221,729,0001,037,0002,129,920stderr
5Aug 23, 2026 16:562,77931,114,14021,754,0001,035,0002,129,920stderr
6Aug 23, 2026 16:565,41452,697,12643,246,0001,156,0002,129,920stderr
7Aug 23, 2026 16:565,42352,820,06643,360,0001,110,0002,129,920stderr
8Aug 23, 2026 16:565,42352,922,14143,315,0001,161,0002,129,920stderr
9Aug 23, 2026 16:565,45553,673,02143,722,0001,016,0002,129,920stderr