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 23, 2026 23:48Victor MerckléVictor MerckléScore: 3,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:493,07732,872,80524,008,0001,226,0002,113,536
2Jun 23, 2026 23:493,09233,393,92724,142,0001,218,0002,113,536
3Jun 23, 2026 23:493,11033,227,52624,275,0001,233,0002,113,536
4Jun 23, 2026 23:493,12133,180,67924,399,0001,194,0002,113,536
5Jun 23, 2026 23:493,12733,797,40624,437,0001,205,0002,113,536
6Jun 23, 2026 23:4912,010106,474,65297,478,0001,011,0002,113,536
7Jun 23, 2026 23:4912,117108,120,55298,356,0001,010,0002,113,536
8Jun 23, 2026 23:4912,651111,363,564102,735,0001,008,0002,113,536
9Jun 23, 2026 23:4912,700111,746,894103,134,0001,008,0002,113,536