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 listSep 1, 2026 14:13Victor MerckléVictor MerckléScore: 2,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:152,61330,458,00620,290,0001,142,0002,117,632stderr
2Sep 1, 2026 14:152,61630,516,27620,432,0001,025,0002,117,632stderr
3Sep 1, 2026 14:152,62029,960,76320,416,0001,069,0002,117,632stderr
4Sep 1, 2026 14:152,62229,629,32820,477,0001,024,0002,117,632stderr
5Sep 1, 2026 14:152,62629,939,06620,494,0001,040,0002,117,632stderr
6Sep 1, 2026 14:152,62930,320,79520,539,0001,024,0002,117,632stderr
7Sep 1, 2026 14:155,31552,650,66242,331,0001,259,0002,117,632stderr
8Sep 1, 2026 14:155,42252,913,56143,447,0001,021,0002,117,632stderr
9Sep 1, 2026 14:155,42352,922,08543,432,0001,043,0002,117,632stderr