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 7, 2026 07:42Rajarshi BasuRajarshi BasuScore: 70,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 07:424,38468,593,14528,960,0006,990,0002,461,696
2Jan 7, 2026 07:424,52162,604,81834,069,0003,006,0002,523,136
3Jan 7, 2026 07:424,94973,189,74637,537,0003,043,0002,469,888
4Jan 7, 2026 07:4270,687609,784,098450,714,000128,918,0002,285,568
5Jan 7, 2026 07:4275,720648,015,463497,925,000122,981,0002,326,528
6Jan 7, 2026 07:4291,531779,257,818644,617,000105,937,0002,473,984