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:20Andrew EpsteinAndrew EpsteinScore: 69,888Success
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:2169,089577,754,744565,531,0001,003,0002,117,632stderr
2Sep 19, 2026 19:2169,660581,908,282570,213,0001,002,0002,117,632stderr
3Sep 19, 2026 19:2169,825583,598,873571,567,0001,002,0002,117,632stderr
4Sep 19, 2026 19:2169,862584,061,645571,864,0001,005,0002,117,632stderr
5Sep 19, 2026 19:2169,888583,700,678572,086,0001,002,0002,117,632stderr
6Sep 19, 2026 19:2169,930583,837,836572,424,0001,002,0002,117,632stderr
7Sep 19, 2026 19:2170,051584,844,043573,416,0001,005,0002,117,632stderr
8Sep 19, 2026 19:2170,311586,973,532575,548,0001,003,0002,117,632stderr
9Sep 19, 2026 19:2170,345587,282,039575,814,0001,020,0002,117,632stderr