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 24, 2024 19:37Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2024 19:3700000Error: expected "2192440591 ", got "1680987624"
2Apr 24, 2024 19:3700000Error: expected "2199203263 ", got "2319148859"
3Apr 24, 2024 19:3700000Error: No answer to stdout. Died or killed?
4Apr 24, 2024 19:3700000Error: expected "2204675527 ", got "3586898608"
5Apr 24, 2024 19:3700000Error: No answer to stdout. Died or killed?