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 2, 2026 04:40Rajarshi BasuRajarshi BasuScore: 13,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:4013,163134,103,195102,940,0004,997,0002,355,200
2Jan 2, 2026 04:4013,534139,090,059103,981,0006,998,0002,441,216
3Jan 2, 2026 04:4013,661137,902,906107,017,0005,000,0002,281,472