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 27, 2026 11:43Victor MerckléVictor MerckléScore: 12,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 11:443,20735,652,15225,253,0001,050,0002,138,112
2Jun 27, 2026 11:443,27637,390,56024,748,0002,122,0002,138,112
3Jun 27, 2026 11:443,28534,738,57524,878,0002,065,0002,138,112
4Jun 27, 2026 11:443,29436,603,75225,969,0001,048,0002,138,112
5Jun 27, 2026 11:4412,800115,811,118102,762,0002,198,0002,138,112
6Jun 27, 2026 11:4412,844114,849,438103,232,0002,089,0002,138,112
7Jun 27, 2026 11:4412,856115,816,605103,344,0002,076,0002,138,112
8Jun 27, 2026 11:4412,907115,025,438103,594,0002,249,0002,138,112
9Jun 27, 2026 11:4412,934115,776,755103,823,0002,239,0002,138,112