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 9, 2025 06:52NoSIMD_C#NoSIMD_C#Score: 209,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 06:52156,3151,306,636,1861,169,890,000111,893,0002,523,136
2Apr 9, 2025 06:52209,6501,746,372,6971,600,194,000118,940,0002,490,368
3Apr 9, 2025 06:52252,4732,100,108,3981,973,315,00096,966,0002,523,136