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 14:19Victor MerckléVictor MerckléScore: 3,007Success
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 14:202,97932,800,18623,354,0001,080,0002,117,632stderr
2Aug 23, 2026 14:202,98832,878,43223,471,0001,037,0002,117,632stderr
3Aug 23, 2026 14:202,99132,827,93923,492,0001,039,0002,117,632stderr
4Aug 23, 2026 14:202,99232,844,78523,466,0001,075,0002,117,632stderr
5Aug 23, 2026 14:203,00733,022,30122,656,0002,003,0002,117,632stderr
6Aug 23, 2026 14:205,59254,236,80543,698,0002,162,0002,117,632stderr
7Aug 23, 2026 14:205,62454,479,89943,955,0002,166,0002,117,632stderr
8Aug 23, 2026 14:205,63154,562,46244,079,0002,097,0002,117,632stderr
9Aug 23, 2026 14:2014,569127,827,669117,313,0002,159,0002,117,632stderr