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 8, 2026 07:09Rajarshi BasuRajarshi BasuScore: 72,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 07:096,09880,624,42943,006,0007,001,0002,355,200
2Jan 8, 2026 07:0972,512625,529,656478,674,000115,921,0002,310,144
3Jan 8, 2026 07:0997,454826,946,587677,256,000121,866,0002,490,368