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 listApr 24, 2025 14:42Emanuele BolognesiEmanuele BolognesiScore: 41,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 14:4241,113360,130,829217,081,000120,044,0002,494,464
2Apr 24, 2025 14:4241,131362,123,271221,526,000115,752,0002,404,352
3Apr 24, 2025 14:4241,147365,280,718216,617,000120,786,0002,277,376
4Apr 24, 2025 14:4241,518366,824,688214,653,000125,796,0002,392,064
5Apr 24, 2025 14:4241,588372,787,486217,013,000124,007,0002,400,256
6Apr 24, 2025 14:4242,051368,163,162221,882,000122,935,0002,506,752
7Apr 24, 2025 14:4242,140372,841,493221,710,000123,838,0002,465,792
8Apr 24, 2025 14:4242,559379,980,671222,988,000125,993,0002,396,160
9Apr 24, 2025 14:4243,692383,492,731245,502,000112,771,0002,273,280