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 14:35Victor MerckléVictor MerckléScore: 2,626Success
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 14:392,61529,802,97320,306,0001,141,0002,117,632stderr
2Sep 1, 2026 14:392,61529,535,55620,423,0001,027,0002,117,632stderr
3Sep 1, 2026 14:392,61629,814,66120,426,0001,026,0002,117,632stderr
4Sep 1, 2026 14:392,62329,630,26620,488,0001,024,0002,117,632stderr
5Sep 1, 2026 14:392,62630,530,59320,507,0001,030,0002,117,632stderr
6Sep 1, 2026 14:392,62629,936,37520,523,0001,014,0002,117,632stderr
7Sep 1, 2026 14:392,62729,681,01720,520,0001,027,0002,117,632stderr
8Sep 1, 2026 14:392,62829,957,56920,533,0001,017,0002,117,632stderr
9Sep 1, 2026 14:395,29551,607,19842,402,0001,021,0002,117,632stderr