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 listApr 25, 2023 20:09Franek KortaFranek KortaScore: 12,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2023 20:0912,231154,830,431100,292,78402,195,456
2Apr 25, 2023 20:0912,353156,085,199101,291,87302,240,512
3Apr 25, 2023 20:0912,808188,438,096105,023,07502,199,552