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 23, 2026 23:33Victor MerckléVictor MerckléScore: 11,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:343,04332,634,16623,923,0001,031,0002,117,632stderr
2Jun 23, 2026 23:343,04832,651,74923,772,0001,227,0002,117,632stderr
3Jun 23, 2026 23:343,07432,861,31524,178,0001,030,0002,117,632stderr
4Jun 23, 2026 23:3411,905105,263,67196,612,0001,009,0002,117,632stderr
5Jun 23, 2026 23:3411,991106,020,04997,320,0001,010,0002,117,632stderr
6Jun 23, 2026 23:3412,013106,148,23097,499,0001,010,0002,117,632stderr
7Jun 23, 2026 23:3412,044106,407,66597,752,0001,009,0002,117,632stderr
8Jun 23, 2026 23:3412,104106,906,55398,239,0001,017,0002,117,632stderr
9Jun 23, 2026 23:3412,154107,325,95298,660,0001,010,0002,117,632stderr