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 15:17Victor MerckléVictor MerckléScore: 5,430Success
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 15:182,73731,483,97721,424,0001,025,0002,117,632stderr
2Aug 19, 2026 15:182,74730,857,81321,508,0001,021,0002,117,632stderr
3Aug 19, 2026 15:182,76030,912,78321,619,0001,015,0002,117,632stderr
4Aug 19, 2026 15:182,76730,973,30421,597,0001,099,0002,117,632stderr
5Aug 19, 2026 15:185,43053,608,26743,383,0001,146,0002,117,632stderr
6Aug 19, 2026 15:185,44052,868,66743,468,0001,145,0002,117,632stderr
7Aug 19, 2026 15:185,44753,796,65543,526,0001,141,0002,117,632stderr
8Aug 19, 2026 15:185,49754,664,02543,920,0001,157,0002,117,632stderr
9Aug 19, 2026 15:185,57354,845,90344,673,0001,029,0002,117,632stderr