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 06:10Rajarshi BasuRajarshi BasuScore: 88,280Success
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 06:1084,043714,193,342567,300,000121,849,0002,400,256
2Jan 2, 2026 06:1088,280750,175,462596,914,000126,981,0002,375,680
3Jan 2, 2026 06:10126,4851,064,098,943920,274,000116,907,0002,322,432