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 21, 2026 16:10Charles CabergsCharles CabergsScore: 9,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 16:119,88792,356,29176,071,0005,004,0002,367,488
2Apr 21, 2026 16:119,91298,849,94777,272,0004,014,0002,383,872
3Apr 21, 2026 16:119,96798,358,11077,746,0003,986,0002,322,432
4Apr 21, 2026 16:119,984102,244,41578,874,0002,995,0002,359,296
5Apr 21, 2026 16:119,99798,436,22278,979,0002,999,0002,412,544
6Apr 21, 2026 16:1110,000101,636,08578,006,0004,000,0002,330,624
7Apr 21, 2026 16:1110,044104,370,94777,343,0005,022,0002,383,872
8Apr 21, 2026 16:1110,05299,544,84080,424,0002,010,0002,416,640
9Apr 21, 2026 16:1110,128100,246,00881,056,0002,001,0002,297,856