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 listDec 27, 2023 10:30Oleg KovalovOleg KovalovScore: 962,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2023 10:30960,3417,934,366,3337,874,798,34302,289,664
2Dec 27, 2023 10:30962,2317,965,095,1817,890,293,40302,301,952
3Dec 27, 2023 10:30966,8017,994,146,0277,927,771,75402,281,472