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:22Victor MerckléVictor MerckléScore: 2,754Success
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:232,72630,707,53421,251,0001,109,0002,117,632stderr
2Aug 29, 2026 13:232,73530,529,24821,341,0001,089,0002,117,632stderr
3Aug 29, 2026 13:232,74130,872,45521,371,0001,109,0002,117,632stderr
4Aug 29, 2026 13:232,74330,649,32721,470,0001,026,0002,117,632stderr
5Aug 29, 2026 13:232,75430,970,98021,566,0001,022,0002,117,632stderr
6Aug 29, 2026 13:232,75531,581,12121,575,0001,024,0002,117,632stderr
7Aug 29, 2026 13:235,39252,533,35743,093,0001,124,0002,117,632stderr
8Aug 29, 2026 13:235,39652,626,07143,209,0001,043,0002,117,632stderr
9Aug 29, 2026 13:235,43252,854,84943,417,0001,126,0002,117,632stderr