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 23, 2026 13:56Victor MerckléVictor MerckléScore: 5,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 13:572,72330,801,93021,249,0001,085,0002,117,632stderr
2Aug 23, 2026 13:572,74430,604,15121,413,0001,089,0002,117,632stderr
3Aug 23, 2026 13:572,75030,636,95321,531,0001,022,0002,117,632stderr
4Aug 23, 2026 13:572,76131,646,09921,618,0001,025,0002,117,632stderr
5Aug 23, 2026 13:575,39253,770,72843,097,0001,124,0002,117,632stderr
6Aug 23, 2026 13:575,40552,474,40143,186,0001,143,0002,117,632stderr
7Aug 23, 2026 13:575,40952,528,50043,315,0001,043,0002,117,632stderr
8Aug 23, 2026 13:575,41852,544,50643,310,0001,124,0002,117,632stderr
9Aug 23, 2026 13:5714,685128,635,087119,411,0001,006,0002,117,632stderr