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:26limanjun99limanjun99Score: 41,114Success
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:2638,536340,925,718311,996,0003,999,0002,367,488
2Mar 17, 2026 14:2639,896351,513,794323,147,0004,001,0002,355,200
3Mar 17, 2026 14:2640,454366,178,418327,726,0003,996,0002,449,408
4Mar 17, 2026 14:2640,494361,402,752328,051,0004,000,0002,408,448
5Mar 17, 2026 14:2641,114362,998,446333,137,0004,001,0002,310,144
6Mar 17, 2026 14:2641,509360,649,253337,371,0003,003,0002,408,448
7Mar 17, 2026 14:2642,053369,535,469339,834,0004,997,0002,330,624
8Mar 17, 2026 14:2643,006378,367,383348,657,0003,996,0002,453,504
9Mar 17, 2026 14:2643,278384,977,079349,882,0004,998,0002,260,992