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 14:34Arseniy KorobenkoArseniy KorobenkoScore: 9,975Success
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 14:349,945106,960,97781,551,00002,387,968
2Mar 26, 2026 14:349,969110,241,32679,754,0001,993,0002,510,848
3Mar 26, 2026 14:349,970116,165,18480,760,000997,0002,400,256
4Mar 26, 2026 14:349,973109,606,99679,783,0001,994,0002,269,184
5Mar 26, 2026 14:349,975110,238,67279,797,0001,994,0002,486,272
6Mar 26, 2026 14:349,989105,159,08279,913,0001,997,0002,375,680
7Mar 26, 2026 14:3410,002107,594,43978,016,0004,000,0002,408,448
8Mar 26, 2026 14:3410,026110,020,85479,205,0003,007,0002,408,448
9Mar 26, 2026 14:3410,090109,202,49279,751,0002,990,0002,310,144