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 14, 2024 00:49zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:4900000Error: Exit with code 1: not a dynamic executable 0 0 0 4294967295 50000000 100000000 2004318071 2290649223 43915152 5858049stderr
2Oct 14, 2024 00:494,98465,919,38131,899,0008,971,0002,502,656
3Oct 14, 2024 00:495,04863,400,48335,337,0006,057,0002,387,968
4Oct 14, 2024 00:495,12272,281,02735,004,0007,000,0002,310,144
5Oct 14, 2024 00:495,21274,053,05631,806,00010,933,0002,289,664
6Oct 14, 2024 00:495,23565,848,72333,945,0008,985,0002,420,736
7Oct 14, 2024 00:495,27576,958,28931,184,00012,071,0002,527,232
8Oct 14, 2024 00:495,30365,209,78933,372,00010,112,0002,318,336
9Oct 14, 2024 00:495,30571,925,45929,336,00014,162,0002,338,816
10Oct 14, 2024 00:495,38471,728,09536,121,0008,027,0002,510,848