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 26, 2026 18:23Arseniy KorobenkoArseniy KorobenkoScore: 9,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 18:239,727107,848,41177,767,0001,994,0002,375,680
2Mar 26, 2026 18:239,745105,123,06874,911,0004,994,0002,408,448
3Mar 26, 2026 18:239,749106,096,50877,944,0001,998,0002,334,720
4Mar 26, 2026 18:239,752105,662,04677,970,0001,999,0002,490,368
5Mar 26, 2026 18:239,762106,889,11777,044,0003,001,0002,355,200
6Mar 26, 2026 18:239,768103,768,11678,097,0002,002,0002,519,040
7Mar 26, 2026 18:239,797104,554,30278,328,0002,008,0002,478,080
8Mar 26, 2026 18:239,804105,037,27680,394,00002,371,584
9Mar 26, 2026 18:239,812102,628,57877,439,0003,017,0002,416,640