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 11:05Victor MerckléVictor MerckléScore: 5,376Success
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 11:062,73730,780,39321,345,0001,099,0002,117,632stderr
2Aug 29, 2026 11:062,75630,732,95621,588,0001,018,0002,117,632stderr
3Aug 29, 2026 11:062,76731,695,84121,669,0001,021,0002,117,632stderr
4Aug 29, 2026 11:062,77531,799,20521,692,0001,069,0002,117,632stderr
5Aug 29, 2026 11:065,37652,446,27743,041,0001,050,0002,117,632stderr
6Aug 29, 2026 11:065,37852,326,20143,041,0001,064,0002,117,632stderr
7Aug 29, 2026 11:065,39552,476,24843,221,0001,022,0002,117,632stderr
8Aug 29, 2026 11:065,40352,676,57843,170,0001,135,0002,117,632stderr
9Aug 29, 2026 11:065,40553,317,11243,197,0001,128,0002,117,632stderr