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:43Prisyazhnyuk AlexanderPrisyazhnyuk AlexanderScore: 1,178,506Success
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:431,168,3059,636,025,4999,580,098,70802,220,032
2Jul 31, 2021 22:431,178,5069,723,327,1579,663,749,27802,256,896
3Jul 31, 2021 22:431,179,2249,730,910,4859,669,636,04502,228,224