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 18, 2026 04:51limanjun99limanjun99Score: 41,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:5139,634350,577,981323,000,0002,000,0002,322,432
2Mar 18, 2026 04:5139,637350,116,731322,023,0003,000,0002,367,488
3Mar 18, 2026 04:5141,225361,641,628335,048,0003,000,0002,482,176
4Mar 18, 2026 04:5141,730365,051,014340,186,0002,001,0002,342,912
5Mar 18, 2026 04:5141,844374,504,790339,122,0004,001,0002,289,664
6Mar 18, 2026 04:5142,085375,970,817342,101,0003,000,0002,273,280
7Mar 18, 2026 04:5142,170375,535,573343,797,0001,998,0002,285,568
8Mar 18, 2026 04:5142,284372,257,417343,730,0002,997,0002,506,752
9Mar 18, 2026 04:5143,123377,455,624351,612,0001,997,0002,424,832