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 listJun 25, 2026 15:57Zhou180Zhou180Score: 4,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:594,40545,309,11633,992,0002,129,0002,117,632
2Jun 25, 2026 15:594,44345,616,41034,193,0002,241,0002,117,632
3Jun 25, 2026 15:594,45145,680,73534,297,0002,206,0002,117,632
4Jun 25, 2026 15:594,46045,800,40434,381,0002,197,0002,117,632
5Jun 25, 2026 15:594,48345,886,54334,527,0002,239,0002,117,632
6Jun 25, 2026 15:594,49646,038,57534,638,0002,235,0002,117,632
7Jun 25, 2026 15:594,53946,334,26034,939,0002,287,0002,117,632
8Jun 25, 2026 15:594,55646,447,30335,084,0002,277,0002,117,632
9Jun 25, 2026 15:5922,740195,627,713183,303,0003,167,0002,117,632