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 listApr 26, 2026 15:16olliecrowolliecrowScore: 23,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:173,30044,404,64425,061,0002,004,0002,535,424stderr
2Apr 26, 2026 15:173,33642,733,07625,330,0002,026,0002,392,064stderr
3Apr 26, 2026 15:1723,725210,575,405189,565,0004,988,0002,564,096stderr
4Apr 26, 2026 15:1723,770212,749,890191,919,0002,998,0002,510,848stderr
5Apr 26, 2026 15:1723,782215,532,336192,015,0003,000,0002,490,368stderr
6Apr 26, 2026 15:1723,800215,528,903193,165,0002,001,0002,527,232stderr
7Apr 26, 2026 15:1723,801214,427,931194,170,0001,000,0002,322,432stderr
8Apr 26, 2026 15:1723,826214,499,978194,375,0001,001,0002,482,176stderr
9Apr 26, 2026 15:1723,905217,112,844194,024,0002,000,0002,510,848stderr