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 08:10NoSIMD_C#NoSIMD_C#Error
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 07:2900000Error: expected "2199733520 ", got "2190433290 "
2Apr 9, 2025 08:0900000Error: expected "2352306392 ", got "2190433313 "
3Apr 9, 2025 08:10190,3691,586,449,3241,436,103,000124,922,0002,514,944
4Apr 9, 2025 08:10235,1231,952,475,3391,820,067,000107,944,0002,408,448
5Apr 9, 2025 08:10330,3442,743,141,5772,582,872,000125,945,0002,523,136