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 18:34Victor MerckléVictor MerckléScore: 5,375Success
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 18:352,74730,784,69921,437,0001,096,0002,117,632stderr
2Aug 23, 2026 18:352,78031,091,54121,789,0001,012,0002,117,632stderr
3Aug 23, 2026 18:352,78131,071,06221,771,0001,035,0002,117,632stderr
4Aug 23, 2026 18:352,78431,054,87621,817,0001,015,0002,117,632stderr
5Aug 23, 2026 18:355,37552,311,84243,054,0001,028,0002,117,632stderr
6Aug 23, 2026 18:355,41953,430,07343,255,0001,184,0002,117,632stderr
7Aug 23, 2026 18:355,41952,693,11843,299,0001,139,0002,117,632stderr
8Aug 23, 2026 18:355,42952,783,88443,366,0001,159,0002,117,632stderr
9Aug 23, 2026 18:355,43852,877,73243,542,0001,050,0002,117,632stderr