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 16, 2023 22:23Franek KortaFranek KortaScore: 14,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2023 22:2313,753178,374,911112,772,09402,252,800
2Apr 16, 2023 22:2314,721192,572,482120,714,13902,195,456
3Apr 16, 2023 22:2314,941181,215,671122,517,89502,248,704