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 listMar 19, 2026 00:14Dominique GarmierDominique GarmierScore: 18,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:1418,408177,254,682149,946,000999,0002,453,504
2Mar 19, 2026 00:1418,475178,169,134150,493,0001,003,0002,428,928
3Mar 19, 2026 00:1418,625181,349,825151,728,000998,0002,371,584