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 8, 2026 12:12Victor MerckléVictor MerckléScore: 3,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 12:143,03238,652,57621,358,0003,509,00024,576stderr
2Sep 8, 2026 12:143,06133,469,74020,696,0004,405,00024,576stderr
3Sep 8, 2026 12:143,07841,977,50421,445,0003,800,00024,576stderr
4Sep 8, 2026 12:143,08333,547,52420,393,0004,893,00024,576stderr
5Sep 8, 2026 12:143,08733,685,21520,907,0004,409,00024,576stderr
6Sep 8, 2026 12:143,44042,756,74321,544,0006,666,00024,576stderr
7Sep 8, 2026 12:145,90056,745,50143,084,0005,300,00024,576stderr
8Sep 8, 2026 12:146,00457,537,04943,235,0006,003,00024,576stderr
9Sep 8, 2026 12:146,48062,270,17743,927,0009,209,00024,576stderr