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 12:04Victor MerckléVictor MerckléScore: 5,371Success
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 12:052,72530,698,00021,273,0001,078,0002,117,632stderr
2Aug 29, 2026 12:052,72930,722,08021,295,0001,089,0002,117,632stderr
3Aug 29, 2026 12:052,75231,235,13121,563,0001,010,0002,117,632stderr
4Aug 29, 2026 12:052,75531,013,37721,576,0001,017,0002,117,632stderr
5Aug 29, 2026 12:055,37152,379,39643,017,0001,027,0002,117,632stderr
6Aug 29, 2026 12:055,41952,814,19843,320,0001,123,0002,117,632stderr
7Aug 29, 2026 12:055,42052,777,23943,313,0001,135,0002,117,632stderr
8Aug 29, 2026 12:055,42653,595,42743,356,0001,145,0002,117,632stderr
9Aug 29, 2026 12:055,46453,205,48543,673,0001,134,0002,117,632stderr