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 listJun 12, 2026 12:44Victor MerckléVictor MerckléScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 12:473,49137,744,91826,121,0002,511,0002,129,920
2Jun 12, 2026 12:473,49537,591,58626,218,0002,444,0002,129,920
3Jun 12, 2026 12:473,51137,840,78126,607,0002,185,0002,129,920
4Jun 12, 2026 12:473,51637,775,40726,655,0002,177,0002,134,016
5Jun 12, 2026 12:473,53438,051,52926,746,0002,240,0002,134,016
6Jun 12, 2026 12:473,60938,606,22927,075,0002,520,0002,129,920
7Jun 12, 2026 12:473,64138,859,01327,601,0002,256,0002,129,920
8Jun 12, 2026 12:476,73664,322,23252,070,0003,172,0002,174,976
9Jun 12, 2026 12:4713,003115,532,674103,252,0003,380,0002,134,016