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 31, 2026 12:34Victor MerckléVictor MerckléScore: 5,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:352,73733,059,74121,336,0001,112,0002,117,632stderr
2Aug 31, 2026 12:352,81131,401,44522,027,0001,024,0002,117,632stderr
3Aug 31, 2026 12:355,39052,599,70142,952,0001,250,0002,117,632stderr
4Aug 31, 2026 12:355,39852,592,78142,994,0001,276,0002,117,632stderr
5Aug 31, 2026 12:355,41452,870,01643,369,0001,026,0002,117,632stderr
6Aug 31, 2026 12:355,42552,850,53343,380,0001,110,0002,117,632stderr
7Aug 31, 2026 12:355,43553,806,95443,480,0001,090,0002,117,632stderr
8Aug 31, 2026 12:355,47353,249,15543,842,0001,042,0002,117,632stderr
9Aug 31, 2026 12:355,49253,531,06644,007,0001,028,0002,117,632stderr