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 17:22Arseniy KorobenkoArseniy KorobenkoScore: 9,864Success
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 17:229,801105,533,06977,353,0003,013,0002,383,872
2Mar 26, 2026 17:229,818108,499,32477,486,0003,018,0002,387,968
3Mar 26, 2026 17:229,857109,928,20178,833,0001,995,0002,519,040
4Mar 26, 2026 17:229,859110,009,45677,850,0002,994,0002,387,968
5Mar 26, 2026 17:229,864106,599,90077,889,0002,995,0002,289,664
6Mar 26, 2026 17:229,869116,876,88879,925,000999,0002,523,136
7Mar 26, 2026 17:229,887108,008,58578,071,0003,002,0002,396,160
8Mar 26, 2026 17:229,892110,214,44179,110,0002,002,0002,396,160
9Mar 26, 2026 17:229,907106,441,30277,224,0004,011,0002,465,792