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 listJul 8, 2026 01:51Victor MerckléVictor MerckléScore: 3,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:513,15933,859,67324,858,0001,050,0002,117,632stderr
2Jul 8, 2026 01:513,18534,201,59325,098,0001,023,0002,117,632stderr
3Jul 8, 2026 01:513,19134,322,38825,145,0001,028,0002,117,632stderr
4Jul 8, 2026 01:513,19134,237,42625,140,0001,031,0002,117,632stderr
5Jul 8, 2026 01:513,20534,361,91425,265,0001,024,0002,117,632stderr
6Jul 8, 2026 01:513,20634,910,36925,272,0001,019,0002,117,632stderr
7Jul 8, 2026 01:513,22034,571,70225,379,0001,033,0002,117,632stderr
8Jul 8, 2026 01:5112,049106,893,68297,768,0001,040,0002,117,632stderr
9Jul 8, 2026 01:5112,611111,354,648102,267,0001,147,0002,117,632stderr