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 19, 2026 08:39Victor MerckléVictor MerckléScore: 5,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 08:402,88132,000,96922,495,0001,133,0002,117,632stderr
2Aug 19, 2026 08:402,88631,961,17822,545,0001,125,0002,117,632stderr
3Aug 19, 2026 08:402,97532,710,13723,284,0001,118,0002,117,632stderr
4Aug 19, 2026 08:405,46653,202,07843,726,0001,103,0002,117,632stderr
5Aug 19, 2026 08:405,49853,381,10843,974,0001,112,0002,117,632stderr
6Aug 19, 2026 08:405,50954,099,67444,075,0001,105,0002,117,632stderr
7Aug 19, 2026 08:405,53253,769,45344,238,0001,127,0002,117,632stderr
8Aug 19, 2026 08:405,60754,370,94344,852,0001,127,0002,117,632stderr
9Aug 19, 2026 08:405,70155,713,36445,468,0001,285,0002,117,632stderr