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:28Rajarshi BasuRajarshi BasuScore: 34,807Success
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:2834,712309,207,809142,818,000141,820,0002,428,928
2Jan 2, 2026 04:2834,807314,482,271143,705,000141,709,0002,420,736
3Jan 2, 2026 04:2835,205317,494,813142,841,000145,838,0002,314,240