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 19, 2026 13:17Victor MerckléVictor MerckléScore: 2,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 13:232,83031,460,03722,184,0001,023,0002,117,632stderr
2Aug 19, 2026 13:232,84131,520,82422,286,0001,015,0002,117,632stderr
3Aug 19, 2026 13:232,89032,781,69122,673,0001,030,0002,117,632stderr
4Aug 19, 2026 13:232,89631,884,17922,592,0001,160,0002,117,632stderr
5Aug 19, 2026 13:232,92933,148,79322,975,0001,043,0002,117,632stderr
6Aug 19, 2026 13:233,00633,760,31123,473,0001,179,0002,117,632stderr
7Aug 19, 2026 13:235,47653,225,91543,733,0001,174,0002,117,632stderr
8Aug 19, 2026 13:235,49654,158,44743,928,0001,146,0002,117,632stderr
9Aug 19, 2026 13:235,54953,820,98244,361,0001,141,0002,117,632stderr