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 listFeb 3, 2025 05:51NoSIMD_C#NoSIMD_C#Score: 974,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:51968,8237,974,611,8927,743,515,000200,831,0002,269,184
2Feb 3, 2025 05:51974,2578,018,162,7237,806,046,000182,860,0002,269,184
3Feb 3, 2025 05:51979,6868,064,905,9187,833,593,000199,836,0002,269,184