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 listOct 13, 2024 21:58zielajzielajScore: 7,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 21:586,63580,787,16344,335,00010,076,0002,293,760
2Oct 13, 2024 21:586,81778,890,66137,930,00017,967,0002,318,336
3Oct 13, 2024 21:586,90882,348,12147,542,0009,103,0002,285,568
4Oct 13, 2024 21:587,05183,166,39639,873,00017,943,0002,281,472
5Oct 13, 2024 21:587,14186,751,33447,454,00011,106,0002,326,528
6Oct 13, 2024 21:587,25683,084,87943,366,00016,136,0002,441,216
7Oct 13, 2024 21:587,37784,274,17842,345,00018,147,0002,523,136
8Oct 13, 2024 21:587,39487,416,71852,544,0008,083,0002,453,504
9Oct 13, 2024 21:587,41785,522,40747,859,00012,961,0002,297,856