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 19, 2026 13:30Victor MerckléVictor MerckléScore: 2,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 13:372,80531,217,56121,937,0001,068,0002,117,632stderr
2Aug 19, 2026 13:372,85632,534,45922,270,0001,151,0002,117,632stderr
3Aug 19, 2026 13:372,87332,257,38422,424,0001,137,0002,117,632stderr
4Aug 19, 2026 13:372,88733,910,90722,666,0001,015,0002,117,632stderr
5Aug 19, 2026 13:372,91632,208,85922,885,0001,028,0002,117,632stderr
6Aug 19, 2026 13:375,46553,082,70943,757,0001,061,0002,117,632stderr
7Aug 19, 2026 13:375,48253,123,24243,812,0001,146,0002,117,632stderr
8Aug 19, 2026 13:375,51153,451,03944,045,0001,147,0002,117,632stderr
9Aug 19, 2026 13:375,64163,506,53445,064,0001,199,0002,117,632stderr