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 listJun 13, 2021 06:30Sergey StreminSergey StreminScore: 247,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 06:30246,1512,193,612,9552,018,441,57602,224,128
2Jun 13, 2021 06:30247,7752,390,862,4422,031,757,10302,207,744
3Jun 13, 2021 06:30252,0712,280,875,6102,066,981,09602,297,856