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:38Victor MerckléVictor MerckléScore: 2,941Success
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:382,86433,144,80222,371,0001,114,0002,117,632stderr
2Aug 19, 2026 08:382,86631,879,86022,472,0001,035,0002,117,632stderr
3Aug 19, 2026 08:382,88732,043,26422,550,0001,125,0002,117,632stderr
4Aug 19, 2026 08:382,90432,107,07022,598,0001,217,0002,117,632stderr
5Aug 19, 2026 08:382,94132,472,45723,011,0001,109,0002,117,632stderr
6Aug 19, 2026 08:382,96732,652,39123,250,0001,082,0002,117,632stderr
7Aug 19, 2026 08:382,98333,444,38123,200,0001,267,0002,117,632stderr
8Aug 19, 2026 08:383,03633,897,47123,697,0001,200,0002,117,632stderr
9Aug 19, 2026 08:385,54253,837,66644,338,0001,107,0002,117,632stderr