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 18, 2026 16:03Maya RebholzMaya RebholzScore: 11,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:0411,185100,913,24890,691,0001,026,0002,125,824
2Jun 18, 2026 16:0411,185100,998,57390,681,0001,040,0002,125,824
3Jun 18, 2026 16:0411,203101,209,64390,824,0001,044,0002,125,824
4Jun 18, 2026 16:0411,209101,104,19690,872,0001,042,0002,125,824
5Jun 18, 2026 16:0411,211101,968,40190,893,0001,041,0002,125,824
6Jun 18, 2026 16:0411,222101,300,63589,995,0002,027,0002,125,824
7Jun 18, 2026 16:0411,242101,382,57390,176,0002,014,0002,125,824
8Jun 18, 2026 16:0411,243101,819,79390,174,0002,024,0002,125,824
9Jun 18, 2026 16:0411,255101,994,94790,247,0002,046,0002,125,824