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 listMay 6, 2023 22:39Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2023 22:3800000Error: expected "1957113393 ", got "4294967295"stderr
2May 6, 2023 22:3916,158193,609,774132,495,80202,277,376
3May 6, 2023 22:3916,229187,384,606133,075,07902,269,184
4May 6, 2023 22:3918,654204,580,990152,966,53702,195,456