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 31, 2026 12:13Victor MerckléVictor MerckléScore: 2,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:142,73230,796,27421,385,0001,018,0002,117,632stderr
2Aug 31, 2026 12:142,73630,802,15821,350,0001,086,0002,117,632stderr
3Aug 31, 2026 12:142,74730,874,36121,460,0001,071,0002,117,632stderr
4Aug 31, 2026 12:142,74830,877,52021,462,0001,077,0002,117,632stderr
5Aug 31, 2026 12:142,75430,711,54521,488,0001,096,0002,117,632stderr
6Aug 31, 2026 12:142,76331,011,41021,505,0001,155,0002,117,632stderr
7Aug 31, 2026 12:142,77230,888,45021,601,0001,133,0002,117,632stderr
8Aug 31, 2026 12:145,42352,774,47043,259,0001,216,0002,117,632stderr
9Aug 31, 2026 12:145,43253,531,41143,310,0001,238,0002,117,632stderr