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:37Victor MerckléVictor MerckléScore: 39,098Success
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:3738,937328,509,094180,833,000138,457,0002,117,632stderr
2Aug 23, 2026 16:3738,964327,882,369180,873,000138,636,0002,117,632stderr
3Aug 23, 2026 16:3738,999328,188,457180,403,000139,391,0002,117,632stderr
4Aug 23, 2026 16:3739,061328,754,848181,617,000138,685,0002,117,632stderr
5Aug 23, 2026 16:3739,098329,581,979181,091,000139,513,0002,117,632stderr
6Aug 23, 2026 16:3739,159330,097,645181,714,000139,390,0002,117,632stderr
7Aug 23, 2026 16:3739,336331,593,913181,165,000141,393,0002,117,632stderr
8Aug 23, 2026 16:3739,426332,355,950181,016,000142,284,0002,117,632stderr
9Aug 23, 2026 16:3739,629334,085,832183,499,000141,466,0002,117,632stderr