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 11, 2024 11:06Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 11:0500000Error: expected "2296812707 ", got "0 "stderr
2Nov 11, 2024 11:0600000Error: No answer to stdout. Died or killed?stderr
3Nov 11, 2024 11:069,096102,904,03365,519,0009,071,0002,387,968
4Nov 11, 2024 11:069,898102,910,19172,147,0009,018,0002,465,792
5Nov 11, 2024 11:0611,113118,393,78785,118,0006,008,0002,473,984