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 28, 2026 01:29Dominique GarmierDominique GarmierScore: 9,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 08:599,467108,076,87274,608,0003,024,0002,310,144
2Mar 28, 2026 08:599,484105,651,89477,768,00002,330,624
3Mar 28, 2026 08:599,487101,879,94675,800,0001,994,0002,428,928
4Mar 28, 2026 01:299,506100,905,60776,950,000999,0002,437,120
5Mar 28, 2026 01:299,520106,447,12776,064,0002,001,0002,486,272
6Mar 28, 2026 01:299,567103,458,49877,442,0001,005,0002,473,984