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 2, 2022 18:51Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 18:5100000Error: No answer to stdout. Died or killed?
2Aug 3, 2022 02:0200000Error: No answer to stdout. Died or killed?
3Aug 3, 2022 02:0200000Error: expected "2089449287 ", got "3759802903 "stderr
4Aug 3, 2022 02:0200000Error: expected "2206883070 ", got "1257008034 "stderr
5Aug 3, 2022 02:0200000Error: expected "2214903087 ", got "1171021043 "stderr
6Aug 3, 2022 02:0300000Error: expected "1930710080 ", got "1285631458 "stderr
7Aug 3, 2022 02:0300000Error: No answer to stdout. Died or killed?
8Aug 3, 2022 02:0400000Error: No answer to stdout. Died or killed?
9Aug 3, 2022 02:0400000Error: No answer to stdout. Died or killed?