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 4, 2025 17:28NoSIMD_C#NoSIMD_C#Score: 275,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 17:28274,9672,283,468,9982,137,797,000116,934,0002,314,240
2Apr 4, 2025 17:28275,7182,285,396,8752,146,945,000113,944,0002,326,528
3Apr 4, 2025 17:28279,8012,324,845,1442,189,445,000104,925,0002,506,752