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 26, 2026 08:28Zhou180Zhou180Score: 3,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:293,84040,712,36930,465,0001,031,0002,117,632
2Jun 26, 2026 08:293,85440,707,21430,581,0001,026,0002,117,632
3Jun 26, 2026 08:293,86940,859,49030,695,0001,035,0002,117,632
4Jun 26, 2026 08:293,87640,960,64830,733,0001,054,0002,117,632
5Jun 26, 2026 08:293,88040,968,61530,769,0001,049,0002,117,632
6Jun 26, 2026 08:2921,703187,124,519175,954,0002,011,0002,117,632
7Jun 26, 2026 08:2922,181191,006,930179,879,0002,012,0002,117,632
8Jun 26, 2026 08:2922,256191,734,952180,491,0002,012,0002,117,632
9Jun 26, 2026 08:2922,533193,951,678182,764,0002,010,0002,117,632