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 15, 2026 02:25zielajzielajScore: 5,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 02:252,78656,205,00921,855,000993,0002,306,048
2Apr 15, 2026 02:242,80251,421,80321,975,000998,0002,392,064
3Apr 15, 2026 02:252,81543,373,86822,080,0001,003,0002,338,816
4Apr 15, 2026 02:252,83445,696,72521,219,0002,020,0002,363,392
5Apr 15, 2026 02:245,25263,718,17541,063,0002,003,0002,510,848
6Apr 15, 2026 02:255,26766,133,86342,185,0001,004,0002,523,136
7Apr 15, 2026 02:255,28963,154,89443,366,00002,490,368
8Apr 15, 2026 02:255,29065,899,89941,358,0002,017,0002,326,528
9Apr 15, 2026 02:255,29964,908,27341,434,0002,021,0002,416,640
10Apr 15, 2026 02:255,30666,191,15343,510,00002,453,504
11Apr 15, 2026 02:245,30966,341,88143,534,00002,314,240
12Apr 15, 2026 02:257,95988,153,90963,252,0002,008,0002,359,296