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 18, 2026 10:53Josu San MartinJosu San MartinScore: 3,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 10:543,36037,441,62926,490,0001,065,0002,117,632
2Aug 18, 2026 10:543,37237,604,22926,592,0001,065,0002,117,632
3Aug 18, 2026 10:543,37438,272,14926,624,0001,049,0002,117,632
4Aug 18, 2026 10:543,38638,412,28126,737,0001,036,0002,117,632
5Aug 18, 2026 10:543,39037,762,33426,748,0001,057,0002,117,632
6Aug 18, 2026 10:543,40338,485,35126,845,0001,061,0002,117,632
7Aug 18, 2026 10:543,41039,413,02526,909,0001,057,0002,117,632
8Aug 18, 2026 10:5411,445103,914,87191,845,0002,007,0002,117,632
9Aug 18, 2026 10:5411,499104,230,16592,286,0002,009,0002,117,632