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 listAug 23, 2026 14:06Victor MerckléVictor MerckléScore: 5,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:082,73030,709,36821,299,0001,091,0002,117,632stderr
2Aug 23, 2026 14:082,74230,858,08421,471,0001,018,0002,117,632stderr
3Aug 23, 2026 14:082,75331,612,06621,566,0001,014,0002,117,632stderr
4Aug 23, 2026 14:082,75530,914,89521,576,0001,020,0002,117,632stderr
5Aug 23, 2026 14:085,39352,552,11643,109,0001,115,0002,117,632stderr
6Aug 23, 2026 14:085,41052,711,57443,241,0001,125,0002,117,632stderr
7Aug 23, 2026 14:085,41553,419,41643,279,0001,124,0002,117,632stderr
8Aug 23, 2026 14:085,55853,941,24844,560,0001,016,0002,117,632stderr
9Aug 23, 2026 14:0814,730129,122,181119,778,0001,013,0002,117,632stderr