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 19, 2026 18:26Andrew EpsteinAndrew EpsteinScore: 39,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:2723,509203,945,535190,706,0002,072,0002,117,632stderr
2Sep 19, 2026 18:2723,517203,276,026191,836,0001,007,0002,117,632stderr
3Sep 19, 2026 18:2723,565203,711,980192,235,0001,004,0002,117,632stderr
4Sep 19, 2026 18:2723,571204,281,692192,285,0001,005,0002,117,632stderr
5Sep 19, 2026 18:2739,136331,447,074319,919,0001,004,0002,117,632stderr
6Sep 19, 2026 18:2739,314332,757,150321,379,0001,003,0002,117,632stderr
7Sep 19, 2026 18:2739,390333,385,013321,998,0001,003,0002,117,632stderr
8Sep 19, 2026 18:2739,638335,581,690324,032,0001,004,0002,117,632stderr
9Sep 19, 2026 18:2739,856338,520,232325,817,0001,005,0002,117,632stderr