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 19, 2026 19:08Andrew EpsteinAndrew EpsteinScore: 20,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:095,33554,084,74942,715,0001,038,0002,117,632stderr
2Sep 19, 2026 19:095,34554,267,17442,801,0001,028,0002,117,632stderr
3Sep 19, 2026 19:095,34955,010,34542,819,0001,046,0002,117,632stderr
4Sep 19, 2026 19:095,38555,189,41843,145,0001,020,0002,117,632stderr
5Sep 19, 2026 19:0920,419177,805,730166,408,0001,032,0002,117,632stderr
6Sep 19, 2026 19:0920,518178,739,187167,243,0001,005,0002,117,632stderr
7Sep 19, 2026 19:0920,655179,890,296168,362,0001,015,0002,117,632stderr
8Sep 19, 2026 19:0920,933182,102,997170,654,0001,004,0002,117,632stderr
9Sep 19, 2026 19:0920,998182,593,407171,155,0001,030,0002,117,632stderr