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 listJul 7, 2026 10:43Victor MerckléVictor MerckléScore: 11,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:442,84031,657,69322,187,0001,104,0002,117,632stderr
2Jul 7, 2026 10:442,87231,576,44422,394,0001,160,0002,117,632stderr
3Jul 7, 2026 10:442,88831,790,45922,570,0001,119,0002,117,632stderr
4Jul 7, 2026 10:442,89431,827,55722,713,0001,025,0002,117,632stderr
5Jul 7, 2026 10:4411,595103,522,07993,942,0001,137,0002,117,632stderr
6Jul 7, 2026 10:4411,642103,381,10794,421,0001,049,0002,117,632stderr
7Jul 7, 2026 10:4411,673105,152,47194,486,0001,238,0002,117,632stderr
8Jul 7, 2026 10:4412,256108,530,95199,379,0001,121,0002,117,632stderr
9Jul 7, 2026 10:4412,351109,299,956100,113,0001,171,0002,117,632stderr