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:31Victor MerckléVictor MerckléScore: 3,361Success
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:323,33035,680,57726,283,0001,023,0002,117,632stderr
2Jul 7, 2026 10:323,33935,390,22126,257,0001,125,0002,117,632stderr
3Jul 7, 2026 10:323,34935,404,36326,340,0001,123,0002,117,632stderr
4Jul 7, 2026 10:323,35335,497,54926,362,0001,140,0002,117,632stderr
5Jul 7, 2026 10:323,36135,535,40026,531,0001,035,0002,117,632stderr
6Jul 7, 2026 10:323,40235,911,17526,865,0001,032,0002,117,632stderr
7Jul 7, 2026 10:323,52436,940,34427,699,0001,205,0002,117,632stderr
8Jul 7, 2026 10:3212,321109,011,75699,991,0001,046,0002,117,632stderr
9Jul 7, 2026 10:3212,515110,549,901101,509,0001,115,0002,117,632stderr