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 listNov 23, 2024 10:49E SequeiraE SequeiraScore: 116,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 10:49114,755967,669,667821,994,000118,999,0002,433,024
2Nov 23, 2024 10:49116,080975,635,084823,875,000127,980,0002,424,832
3Nov 23, 2024 10:49119,4531,009,991,233866,574,000112,944,0002,420,736