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 19:26Andrew EpsteinAndrew EpsteinScore: 17,218Success
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 19:272,65031,698,14521,738,000020,480
2Sep 19, 2026 19:272,66030,711,54021,812,000020,480
3Sep 19, 2026 19:272,71238,801,24522,245,000020,480
4Sep 19, 2026 19:2717,212149,947,523141,145,000020,480
5Sep 19, 2026 19:2717,218162,106,067141,193,000020,480
6Sep 19, 2026 19:2717,249150,297,124141,448,000020,480
7Sep 19, 2026 19:2717,282150,856,564141,715,000020,480
8Sep 19, 2026 19:2717,311150,811,844141,953,000020,480
9Sep 19, 2026 19:2717,883155,456,707146,647,000020,480