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:46Andrew EpsteinAndrew EpsteinScore: 17,718Success
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:472,67031,345,16321,901,000020,480
2Sep 19, 2026 19:472,67831,310,40921,965,000020,480
3Sep 19, 2026 19:472,68031,436,92821,977,000020,480
4Sep 19, 2026 19:4717,210150,394,233141,125,000020,480
5Sep 19, 2026 19:4717,718154,093,538145,289,000020,480
6Sep 19, 2026 19:4717,761155,060,119145,643,000020,480
7Sep 19, 2026 19:4717,772154,555,295145,736,000020,480
8Sep 19, 2026 19:4717,785154,602,717145,843,000020,480
9Sep 19, 2026 19:4717,846155,725,536146,345,000020,480