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 29, 2026 13:21Victor MerckléVictor MerckléScore: 2,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:222,75230,709,43221,481,0001,093,0002,117,632stderr
2Aug 29, 2026 13:222,75330,989,54821,497,0001,085,0002,117,632stderr
3Aug 29, 2026 13:222,75830,952,62921,591,0001,025,0002,117,632stderr
4Aug 29, 2026 13:222,76430,974,11921,643,0001,025,0002,117,632stderr
5Aug 29, 2026 13:222,76931,088,51321,685,0001,022,0002,117,632stderr
6Aug 29, 2026 13:225,43853,583,67443,433,0001,164,0002,117,632stderr
7Aug 29, 2026 13:225,47152,966,81243,825,0001,041,0002,117,632stderr
8Aug 29, 2026 13:225,48453,119,88143,759,0001,212,0002,117,632stderr
9Aug 29, 2026 13:2212,164108,067,62498,731,0001,018,0002,117,632stderr