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 24, 2026 20:06olliecrowolliecrowScore: 3,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 20:073,28147,115,13324,919,0001,993,0002,351,104stderr
2Apr 24, 2026 20:073,29342,335,48724,007,0003,000,0002,547,712stderr
3Apr 24, 2026 20:073,29845,277,83125,046,0002,003,0002,560,000stderr
4Apr 24, 2026 20:073,30642,909,52224,101,0003,012,0002,547,712stderr
5Apr 24, 2026 20:073,31944,502,97624,199,0003,024,0002,457,600stderr
6Apr 24, 2026 20:073,32442,456,20224,230,0003,028,0002,301,952stderr
7Apr 24, 2026 20:073,38841,223,84825,804,0001,984,0002,322,432stderr
8Apr 24, 2026 20:0723,761212,027,630192,843,0001,998,0002,539,520stderr
9Apr 24, 2026 20:0723,848211,965,493192,563,0002,993,0002,371,584stderr