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 listJun 7, 2026 15:48Victor MerckléVictor MerckléScore: 4,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:494,56946,593,79636,426,0001,046,0002,113,536
2Jun 7, 2026 15:494,66450,057,75937,203,0001,044,0002,113,536
3Jun 7, 2026 15:494,71847,851,08337,640,0001,050,0002,113,536
4Jun 7, 2026 15:494,76848,187,74437,085,0002,018,0002,113,536
5Jun 7, 2026 15:494,77348,286,10738,100,0001,043,0002,113,536
6Jun 7, 2026 15:494,80348,465,15438,361,0001,030,0002,113,536
7Jun 7, 2026 15:494,80548,536,01538,362,0001,043,0002,113,536
8Jun 7, 2026 15:494,94549,736,99338,498,0002,058,0002,113,536
9Jun 7, 2026 15:494,94949,680,08539,533,0001,051,0002,113,536