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 8, 2026 07:30Victor MerckléVictor MerckléScore: 2,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:312,58729,612,19221,217,000024,576stderr
2Sep 8, 2026 07:312,59530,496,72021,286,000024,576stderr
3Sep 8, 2026 07:312,59929,746,62521,317,000024,576stderr
4Sep 8, 2026 07:312,60029,709,06021,324,000024,576stderr
5Sep 8, 2026 07:312,61629,798,13520,358,0001,100,00024,576stderr
6Sep 8, 2026 07:312,61729,746,49820,424,0001,041,00024,576stderr
7Sep 8, 2026 07:315,33152,064,32742,702,0001,014,00024,576stderr
8Sep 8, 2026 07:315,34652,243,99142,829,0001,015,00024,576stderr
9Sep 8, 2026 07:315,35452,285,98142,892,0001,016,00024,576stderr