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 listOct 13, 2021 19:54Sergey StreminSergey StreminScore: 12,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 19:5412,654167,781,677103,765,11102,301,952
2Oct 13, 2021 19:5412,675169,167,549103,936,04602,289,664
3Oct 13, 2021 19:5412,700170,495,977104,140,07402,297,856