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 06:36Rajarshi BasuRajarshi BasuScore: 70,290Success
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 06:364,73070,624,57334,810,0003,978,0002,387,968
2Jan 8, 2026 06:3670,290608,398,917449,514,000126,862,0002,293,760
3Jan 8, 2026 06:3677,118664,415,587524,479,000107,892,0002,318,336