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 listSep 1, 2026 12:56Victor MerckléVictor MerckléScore: 2,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 12:572,73832,725,00221,390,0001,067,0002,117,632stderr
2Sep 1, 2026 12:572,74031,467,33721,414,0001,059,0002,117,632stderr
3Sep 1, 2026 12:572,74831,630,74821,451,0001,087,0002,117,632stderr
4Sep 1, 2026 12:572,74831,610,19721,466,0001,073,0002,117,632stderr
5Sep 1, 2026 12:572,75130,930,86621,489,0001,070,0002,117,632stderr
6Sep 1, 2026 12:575,32357,838,42542,460,0001,193,0002,117,632stderr
7Sep 1, 2026 12:575,33652,115,03342,611,0001,152,0002,117,632stderr
8Sep 1, 2026 12:575,36552,350,82642,794,0001,202,0002,117,632stderr
9Sep 1, 2026 12:575,41753,492,76243,225,0001,200,0002,117,632stderr