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 21:20Dominique GarmierDominique GarmierScore: 9,333Success
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 21:209,286100,432,73572,139,0004,007,0002,371,584
2Mar 26, 2026 21:209,28799,815,01474,151,0002,004,0002,453,504
3Mar 26, 2026 21:209,317104,313,60875,391,0001,005,0002,502,656
4Mar 26, 2026 21:209,330108,639,48875,500,0001,006,0002,387,968
5Mar 26, 2026 21:209,333101,620,79973,513,0003,021,0002,457,600
6Mar 26, 2026 21:209,368101,237,59773,824,0002,992,0002,404,352
7Mar 26, 2026 21:209,377106,518,83873,894,0002,995,0002,469,888
8Mar 26, 2026 21:209,40599,504,25375,120,0002,003,0002,510,848
9Mar 26, 2026 21:209,423104,971,97776,267,0001,003,0002,506,752