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 13, 2026 15:01Dominique GarmierDominique GarmierScore: 18,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:0118,732181,525,572151,612,0001,994,0002,506,752
2Mar 13, 2026 15:0118,747179,575,502151,726,0001,996,0002,506,752
3Mar 13, 2026 15:0118,748178,317,953152,739,000998,0002,506,752
4Mar 13, 2026 15:0118,768180,065,941151,903,0001,998,0002,461,696
5Mar 13, 2026 15:0118,770178,248,699151,920,0001,998,0002,506,752
6Mar 13, 2026 15:0118,781179,862,608152,001,0002,000,0002,469,888
7Mar 13, 2026 15:0118,781181,242,289153,006,0001,000,0002,506,752
8Mar 13, 2026 15:0118,785183,076,440153,034,0001,000,0002,297,856
9Mar 13, 2026 15:0118,797178,621,092152,138,0002,001,0002,457,600