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 16, 2026 18:54Maya RebholzMaya RebholzScore: 103,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 18:55100,608834,754,715783,170,00041,819,0002,281,472
2Jun 16, 2026 18:55101,474841,663,471791,481,00040,612,0002,281,472
3Jun 16, 2026 18:55102,240848,146,928795,102,00043,268,0002,281,472
4Jun 16, 2026 18:55102,872852,813,691803,352,00040,206,0002,281,472
5Jun 16, 2026 18:55103,031854,214,928804,746,00040,113,0002,281,472
6Jun 16, 2026 18:55103,219856,197,275806,138,00040,265,0002,281,472
7Jun 16, 2026 18:55105,661875,753,826822,782,00043,645,0002,281,472
8Jun 16, 2026 18:55105,922877,826,860826,565,00041,996,0002,281,472
9Jun 16, 2026 18:55107,820894,611,057840,408,00043,719,0002,281,472