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 listJun 23, 2026 23:16Victor MerckléVictor MerckléScore: 3,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:173,06032,741,89723,862,0001,235,0002,113,536
2Jun 23, 2026 23:173,06832,711,76223,922,0001,237,0002,113,536
3Jun 23, 2026 23:173,08232,933,78924,091,0001,184,0002,113,536
4Jun 23, 2026 23:173,11933,216,20924,356,0001,222,0002,113,536
5Jun 23, 2026 23:173,39335,415,43026,791,0001,033,0002,113,536
6Jun 23, 2026 23:175,96256,868,53247,870,0001,019,0002,113,536
7Jun 23, 2026 23:175,97656,593,01147,987,0001,018,0002,113,536
8Jun 23, 2026 23:176,08557,514,68148,886,0001,017,0002,113,536
9Jun 23, 2026 23:176,12757,857,74549,222,0001,023,0002,113,536