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 17, 2026 14:29limanjun99limanjun99Score: 41,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:2939,670351,902,441321,291,0004,003,0002,404,352
2Mar 17, 2026 14:2939,895353,538,554323,137,0004,001,0002,273,280
3Mar 17, 2026 14:2940,157350,374,600324,285,0005,004,0002,437,120
4Mar 17, 2026 14:2940,254356,952,377328,083,0002,000,0002,449,408
5Mar 17, 2026 14:2941,104359,855,546330,051,0007,001,0002,482,176
6Mar 17, 2026 14:2941,274370,089,414336,448,0002,002,0002,355,200
7Mar 17, 2026 14:2942,243367,053,169343,388,0003,003,0002,445,312
8Mar 17, 2026 14:2942,511373,554,424344,595,0003,995,0002,371,584
9Mar 17, 2026 14:2943,937391,815,675357,289,0002,994,0002,404,352