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 listJul 15, 2023 15:08Paul MasurelPaul MasurelScore: 58,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 15:074,225100,804,47034,641,73102,232,320
2Jul 15, 2023 15:084,268104,719,52234,994,46802,281,472
3Jul 15, 2023 15:0757,787540,726,084473,851,53102,269,184
4Jul 15, 2023 15:0758,037547,546,349475,900,64202,236,416
5Jul 15, 2023 15:0858,476548,026,708479,500,10202,191,360
6Jul 15, 2023 15:0858,505548,157,562479,739,70502,199,552