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 listMar 10, 2026 21:33olliecrowolliecrowScore: 7,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:337,60881,643,46661,376,0001,006,0002,498,560
2Mar 10, 2026 21:337,62289,102,41660,487,0002,016,0002,359,296
3Mar 10, 2026 21:337,66087,607,50059,818,0002,990,0002,416,640
4Mar 10, 2026 21:337,67189,096,88459,905,0002,995,0002,297,856
5Mar 10, 2026 21:337,67789,624,10860,950,0001,998,0002,355,200
6Mar 10, 2026 21:337,77888,531,68557,804,0005,979,0002,367,488
7Mar 10, 2026 21:337,98691,713,67163,471,0002,014,0002,289,664
8Mar 10, 2026 21:3322,638214,530,016181,638,0003,992,0002,482,176
9Mar 10, 2026 21:3323,056215,595,305186,060,0003,000,0002,383,872