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 listJun 20, 2026 18:13A_ShamanA_ShamanScore: 124,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:14119,914992,426,567799,922,000183,373,0002,113,536
2Jun 20, 2026 18:14120,714999,018,319811,787,000178,071,0002,113,536
3Jun 20, 2026 18:14120,9961,001,290,713810,965,000181,210,0002,113,536
4Jun 20, 2026 18:14121,0331,001,660,618810,499,000181,979,0002,113,536
5Jun 20, 2026 18:14124,4021,029,277,725838,878,000181,226,0002,113,536
6Jun 20, 2026 18:14125,4121,037,543,957845,320,000183,059,0002,113,536
7Jun 20, 2026 18:14126,1901,043,881,715852,884,000181,877,0002,113,536
8Jun 20, 2026 18:14126,9841,050,392,120860,699,000180,573,0002,113,536
9Jun 20, 2026 18:14128,6821,064,402,351869,249,000185,946,0002,113,536