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 23, 2026 14:47Dominique GarmierDominique GarmierScore: 10,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 14:2910,051114,517,17581,413,0001,005,0002,289,664
2Mar 23, 2026 14:4710,075109,457,68281,612,0001,007,0002,289,664
3Mar 23, 2026 14:2910,079106,270,82881,652,000995,0002,289,664
4Mar 23, 2026 14:2910,092111,929,64080,760,0001,994,0002,523,136
5Mar 23, 2026 14:2910,094108,898,07581,776,000997,0002,523,136
6Mar 23, 2026 14:2910,095111,950,02880,784,0001,994,0002,289,664
7Mar 23, 2026 14:2910,113106,522,54781,927,000999,0002,289,664
8Mar 23, 2026 14:4710,149107,793,31281,215,0002,005,0002,289,664
9Mar 23, 2026 14:4713,110133,882,082107,506,00002,289,664
10Mar 23, 2026 14:2913,179134,794,137106,067,0002,001,0002,523,136
11Mar 23, 2026 14:2913,210134,542,111107,321,0001,003,0002,265,088
12Mar 23, 2026 14:2913,311137,859,294108,150,0001,001,0002,281,472