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 31, 2024 21:48Yuriy LyfenkoYuriy LyfenkoScore: 4,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 21:484,675560,641,36636,321,0002,017,0002,293,760
2Aug 31, 2024 21:484,696567,141,79536,480,0002,026,0002,363,392
3Aug 31, 2024 21:484,725564,611,49233,776,0004,967,0002,449,408
4Aug 31, 2024 21:484,742568,859,35434,898,0003,988,0002,404,352
5Aug 31, 2024 21:484,747561,737,12332,937,0005,988,0002,351,104
6Aug 31, 2024 21:484,784563,591,05737,221,0002,011,0002,437,120
7Aug 31, 2024 21:484,806566,028,97532,337,0007,073,0002,396,160
8Aug 31, 2024 21:484,818565,539,52035,453,0004,051,0002,445,312
9Aug 31, 2024 21:484,823567,466,75134,477,0005,070,0002,490,368
10Aug 31, 2024 21:484,836567,112,75935,689,0003,965,0002,494,464
11Aug 31, 2024 21:484,844566,509,93937,737,0001,986,0002,342,912
12Aug 31, 2024 21:485,245569,233,67637,006,0006,001,0002,428,928