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 20, 2026 18:10A_ShamanA_ShamanScore: 70,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:1169,211576,683,613384,445,000183,090,0002,113,536
2Jun 20, 2026 18:1169,591580,011,498388,834,000181,817,0002,113,536
3Jun 20, 2026 18:1169,682580,880,625389,002,000182,393,0002,113,536
4Jun 20, 2026 18:1169,686580,426,051391,846,000179,583,0002,113,536
5Jun 20, 2026 18:1170,278585,768,525393,686,000182,601,0002,113,536
6Jun 20, 2026 18:1170,516587,499,184393,348,000184,886,0002,113,536
7Jun 20, 2026 18:1170,527587,821,894392,990,000185,336,0002,113,536
8Jun 20, 2026 18:1170,573587,903,373395,678,000183,027,0002,113,536
9Jun 20, 2026 18:1170,747589,554,627395,089,000185,040,0002,113,536