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:36Victor MerckléVictor MerckléScore: 2,781Success
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:372,74632,142,40021,421,0001,100,0002,117,632stderr
2Aug 23, 2026 14:372,75730,996,38921,585,0001,028,0002,117,632stderr
3Aug 23, 2026 14:372,76431,005,75921,504,0001,166,0002,117,632stderr
4Aug 23, 2026 14:372,77030,815,32721,704,0001,015,0002,117,632stderr
5Aug 23, 2026 14:372,78130,975,52621,800,0001,011,0002,117,632stderr
6Aug 23, 2026 14:375,38052,243,87743,060,0001,059,0002,117,632stderr
7Aug 23, 2026 14:375,45353,075,65543,596,0001,123,0002,117,632stderr
8Aug 23, 2026 14:375,45352,874,15643,579,0001,142,0002,117,632stderr
9Aug 23, 2026 14:3714,687128,573,965119,423,0001,013,0002,117,632stderr