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 listSep 1, 2026 09:50Victor MerckléVictor MerckléScore: 5,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 09:512,78430,992,16321,771,0001,058,0002,117,632stderr
2Sep 1, 2026 09:512,79931,407,84321,894,0001,065,0002,117,632stderr
3Sep 1, 2026 09:512,80131,139,21021,916,0001,055,0002,117,632stderr
4Sep 1, 2026 09:515,42352,581,35043,450,0001,020,0002,117,632stderr
5Sep 1, 2026 09:515,42552,941,39143,464,0001,023,0002,117,632stderr
6Sep 1, 2026 09:515,45453,096,87943,710,0001,020,0002,117,632stderr
7Sep 1, 2026 09:515,45753,184,88343,733,0001,020,0002,117,632stderr
8Sep 1, 2026 09:515,48053,251,87743,912,0001,027,0002,117,632stderr
9Sep 1, 2026 09:515,62154,447,52344,078,0002,017,0002,117,632stderr