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 listJan 9, 2025 09:37Ian MckibbenIan MckibbenError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:3400000Error: No answer to stdout. Died or killed?
2Jan 9, 2025 09:3788,947759,128,602527,539,000201,823,0002,269,184
3Jan 9, 2025 09:3789,960761,284,689523,767,000213,905,0002,338,816
4Jan 9, 2025 09:3793,343793,067,873557,570,000207,839,0002,314,240