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 02:00KeefeKeefeScore: 57,355Success
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 01:5456,732492,135,315292,499,000172,704,0002,457,600
2Apr 24, 2025 01:5456,805487,906,021291,873,000173,924,0002,482,176
3Apr 24, 2025 01:5457,095494,857,063293,486,000174,694,0002,486,272
4Apr 24, 2025 01:5457,268494,407,817290,753,000178,848,0002,363,392
5Apr 24, 2025 02:0057,274492,290,722297,777,000171,871,0002,277,376
6Apr 24, 2025 01:5457,308496,886,278292,956,000176,973,0002,482,176
7Apr 24, 2025 02:0057,355493,999,942292,569,000177,738,0002,347,008
8Apr 24, 2025 01:5457,617498,791,526300,655,000171,803,0002,306,048
9Apr 24, 2025 01:5457,661497,889,116301,886,000170,935,0002,473,984
10Apr 24, 2025 02:0057,894500,511,042300,831,000173,902,0002,314,240
11Apr 24, 2025 01:5458,199504,062,029306,505,000170,724,0002,310,144
12Apr 24, 2025 01:5458,253505,887,260305,794,000171,884,0002,478,080