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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 23:003,24133,997,58625,520,0001,063,0002,113,536
2Jun 22, 2026 23:003,25534,154,17225,644,0001,051,0002,113,536
3Jun 22, 2026 23:003,28334,373,09825,855,0001,070,0002,113,536
4Jun 22, 2026 23:003,29934,502,37326,005,0001,048,0002,113,536
5Jun 22, 2026 23:003,30434,546,20626,041,0001,052,0002,113,536
6Jun 22, 2026 23:003,31534,634,72826,141,0001,049,0002,113,536
7Jun 22, 2026 23:003,32134,646,47526,188,0001,052,0002,113,536
8Jun 22, 2026 23:003,37435,062,73925,568,0002,104,0002,113,536
9Jun 22, 2026 23:0012,391109,013,76699,588,0002,019,0002,113,536