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 listMay 11, 2026 17:48Victor MerckléVictor MerckléScore: 13,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 17:493,49739,304,51427,623,0001,060,0002,113,536
2May 11, 2026 17:493,51239,270,16427,749,0001,051,0002,113,536
3May 11, 2026 17:493,52137,595,95027,807,0001,070,0002,113,536
4May 11, 2026 17:493,57739,727,42527,333,0002,006,0002,113,536
5May 11, 2026 17:4913,451119,131,915108,105,0002,197,0002,113,536
6May 11, 2026 17:4913,546120,214,377109,056,0002,028,0002,113,536
7May 11, 2026 17:4913,548119,841,205108,871,0002,223,0002,113,536
8May 11, 2026 17:4913,600122,175,263109,317,0002,210,0002,113,536
9May 11, 2026 17:4913,626120,448,109109,711,0002,025,0002,113,536