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 8, 2024 22:44Michael AnoprenkoMichael AnoprenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2024 22:4300000Error: expected "2240661804 ", got "2244596383 "
2Aug 8, 2024 22:4439,343391,157,380322,614,94502,265,088
3Aug 8, 2024 22:4439,409393,098,594323,151,72402,269,184
4Aug 8, 2024 22:4439,830402,804,275326,602,86902,392,064