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 15, 2024 23:43zielajzielajScore: 88,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:4276,652656,362,038502,635,000125,908,0002,379,776
2Oct 15, 2024 23:4381,230691,321,968532,271,000133,816,0002,293,760
3Oct 15, 2024 23:4284,684719,168,329559,522,000134,884,0002,465,792
4Oct 15, 2024 23:4385,399730,318,887566,410,000133,860,0002,412,544
5Oct 15, 2024 23:4388,437749,336,324589,334,000135,846,0002,490,368
6Oct 15, 2024 23:4398,769833,252,439679,921,000129,985,0002,469,888
7Oct 15, 2024 23:42108,321916,095,241755,348,000132,885,0002,465,792
8Oct 15, 2024 23:43115,038973,497,544817,403,000125,908,0002,424,832
9Oct 15, 2024 23:43116,033977,225,426815,549,000135,924,0002,273,280