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 listNov 7, 2024 11:41NoSIMD_C#NoSIMD_C#Score: 973,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 11:41964,5367,945,904,1557,702,350,000206,848,0002,306,048
2Nov 7, 2024 11:41968,9157,976,176,0517,738,257,000206,846,0002,306,048
3Nov 7, 2024 11:41971,7877,996,617,8397,767,813,000200,840,0002,281,472
4Nov 7, 2024 11:41972,3798,004,000,3887,764,678,000208,829,0002,400,256
5Nov 7, 2024 11:41973,2738,014,311,3157,768,001,000212,835,0002,281,472
6Nov 7, 2024 11:41974,2838,018,459,8727,773,276,000215,841,0002,281,472
7Nov 7, 2024 11:41974,5458,020,282,2057,797,408,000193,860,0002,281,472
8Nov 7, 2024 11:41975,5758,032,126,3377,792,882,000206,837,0002,281,472
9Nov 7, 2024 11:41976,0528,036,452,7847,801,763,000201,864,0002,281,472