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 listJul 31, 2021 22:28Prisyazhnyuk AlexanderPrisyazhnyuk AlexanderScore: 1,169,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2021 22:281,167,7449,635,115,4179,575,504,05402,203,648
2Jul 31, 2021 22:281,169,5859,653,312,1209,590,595,53502,203,648
3Jul 31, 2021 22:281,180,7009,748,765,6559,681,737,76802,224,128