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 28, 2024 16:26NoSIMD_C#NoSIMD_C#Score: 1,915,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 16:261,861,16915,298,045,74615,125,671,000135,916,0002,437,120
2Nov 28, 2024 16:261,915,33815,739,743,45715,582,845,000122,927,0002,326,528
3Nov 28, 2024 16:261,939,37715,944,238,26615,788,966,000113,927,0002,326,528