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 23, 2026 21:44Victor MerckléVictor MerckléScore: 12,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:453,07332,817,78324,011,0001,191,0002,117,632stderr
2Jun 23, 2026 21:453,07532,830,47324,001,0001,217,0002,117,632stderr
3Jun 23, 2026 21:453,08032,921,44124,074,0001,185,0002,117,632stderr
4Jun 23, 2026 21:4511,948105,736,31096,968,0001,009,0002,117,632stderr
5Jun 23, 2026 21:4512,010106,175,09997,473,0001,009,0002,117,632stderr
6Jun 23, 2026 21:4512,028106,194,77397,624,0001,010,0002,117,632stderr
7Jun 23, 2026 21:4512,100106,853,48198,212,0001,010,0002,117,632stderr
8Jun 23, 2026 21:4512,159107,305,84098,698,0001,010,0002,117,632stderr
9Jun 23, 2026 21:4512,352108,989,457100,274,0001,017,0002,117,632stderr