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 listDec 13, 2024 07:58NoSIMD_C#NoSIMD_C#Score: 961,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2024 07:58953,3997,851,502,3167,623,049,000194,822,0002,289,664
2Dec 13, 2024 07:58957,4807,880,444,8987,659,499,000191,837,0002,306,048
3Dec 13, 2024 07:58958,9487,903,528,2307,666,543,000196,834,0002,277,376
4Dec 13, 2024 07:58959,3047,899,563,6597,674,429,000191,860,0002,277,376
5Dec 13, 2024 07:58961,0617,911,741,7117,689,857,000190,847,0002,482,176
6Dec 13, 2024 07:58961,6437,913,417,8287,687,638,000197,836,0002,277,376
7Dec 13, 2024 07:58962,0177,919,201,5757,695,701,000192,842,0002,277,376
8Dec 13, 2024 07:58962,8457,925,991,6197,697,496,000197,832,0002,277,376
9Dec 13, 2024 07:58962,8768,086,033,0037,696,074,000199,509,0002,277,376